Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
	)

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

var (
	direction1 = [][]int{ // 奇数段目の移動方向
		{-1, 0}, {1, 0}, {0, -1}, {0, 1}, {1, -1}, {1, 1},
	}
	direction2 = [][]int{ // 偶数段目の移動方向
		{-1, -1}, {0, -1}, {1, 0}, {0, 1}, {-1, 1}, {-1, 0},
	}
)

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		m, _ := strconv.Atoi(buf[0])
		n, _ := strconv.Atoi(buf[1])
		if m == 0 && n == 0 {
			break
		}
		// initialize district_map
		/*
			district_map = [
				[-1, -1,  -1,  -1,  -1]
				[-1, INF, INF, INF, -1]
				[-1, INF, INF, INF, -1]
				[-1, INF, INF, INF, -1]
				[-1, INF, INF, INF, -1]
				[-1, -1,  -1,  -1,  -1]
			]
		*/
		district_map := make([][]int, n+2)
		for i := range district_map {
			district_map[i] = make([]int, m+2)
		}
		tmp1 := make([]int, m+2)
		for i := range tmp1 {
			tmp1[i] = -1
		}
		district_map[0] = tmp1
		district_map[n+1] = tmp1
		for i := 1; i < n+1; i++ {
			district_map[i] = make([]int, m+2)
			district_map[i][0] = -1
			district_map[i][m+1] = -1
			for j := 1; j < m+1; j++ {
				district_map[i][j] = INF
			}
		}

		scanner.Scan()
		s, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < s; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			x, _ := strconv.Atoi(buf_[0])
			y, _ := strconv.Atoi(buf_[1])
			Search(Point{x, y}, district_map, m, n)
		}
		ans := 0
		scanner.Scan()
		t, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < t; i++ {
			scanner.Scan()
			buf__ := strings.Split(scanner.Text(), " ")
			x, _ := strconv.Atoi(buf__[0])
			y, _ := strconv.Atoi(buf__[1])
			z := Count(Point{x, y}, district_map, m, n)
			ans = max(ans, z)
		}
		fmt.Println(ans)
	}
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

type Point struct {
	x, y int
}

type Entry struct {
	hop   int
	point Point
}

func Search(p Point, mp [][]int, m, n int) {
	que := make([]Entry, 0)
	que = append(que, Entry{0, p})
	check := make([][]bool, n+2)
	for i := range check {
		check[i] = make([]bool, m+2)
	}
	check[p.y][p.x] = true
	mp[p.y][p.x] = 0
	var direction [][]int
	for len(que) > 0 {
		tmp := que[0]
		que = que[1:]
		dist, point := tmp.hop, tmp.point
		if point.y%2 == 0 {
			direction = direction1
		} else {
			direction = direction2
		}
		for _, d := range direction {
			nx, ny := point.x+d[0], point.y+d[1]
			if !check[ny][nx] && mp[ny][nx] != -1 {
				check[ny][nx] = true
				if mp[ny][nx] > dist+1 {
					mp[ny][nx] = dist + 1
				}
				que = append(que, Entry{dist + 1, Point{nx, ny}})
			}
		}
	}
}

func Count(p Point, mp [][]int, m, n int) int {
	que := make([]Entry, 0)
	que = append(que, Entry{0, p})
	check := make([][]bool, n+2)
	for i := range check {
		check[i] = make([]bool, m+2)
	}
	check[p.y][p.x] = true
	ans := 1
	var direction [][]int
	for len(que) > 0 {
		tmp := que[0]
		que = que[1:]
		dist, point := tmp.hop, tmp.point
		if point.y%2 == 0 {
			direction = direction1
		} else {
			direction = direction2
		}
		for _, d := range direction {
			nx, ny := point.x+d[0], point.y+d[1]
			if !check[ny][nx] && mp[ny][nx] != -1 {
				check[ny][nx] = true
				if mp[ny][nx] > dist+1 {
					ans++
				}
				que = append(que, Entry{dist + 1, Point{nx, ny}})
			}
		}
	}
	return ans
}

C++: #include <bits/stdc++.h>
using namespace std;

#define reps(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reps(i,0,n)

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;

const int INF = 1001001001;

int dist(pii a, pii b)
{
    int dy = a.first - b.first;
    int dx = a.second - b.second;
    if(0 <= dy*dx){
        dy = abs(dy);
        dx = abs(dx);
        return dy + max(0, dx - (dy+1-min(a.first,b.first)%2)/2);
    }
    else{
        dy = abs(dy);
        dx = abs(dx);
        return dy + max(0, dx - (dy + min(a.first, b.first)%2)/2);
    }
}

int main()
{
    int m, n;
    while(scanf("%d%d", &m, &n), m){
        int s;
        scanf("%d", &s);
        pii conv[10];
        rep(i, s)
            scanf("%d%d", &conv[i].second, &conv[i].first);

        int d[101][101];
        rep(i, n) rep(j, m){
            d[i+1][j+1] = INF;
            rep(k, s)
                d[i+1][j+1] = min(d[i+1][j+1], dist(pii(i+1, j+1), conv[k]));
        }

        int t, ans = 0;
        scanf("%d", &t);
        rep(i, t){
            int x, y;
            scanf("%d%d", &x, &y);

            int cnt = 0;
            rep(j, n) rep(k, m)
                cnt += dist(pii(j+1, k+1), pii(y, x)) < d[j+1][k+1];
            ans = max(ans, cnt);
        }
        printf("%d\n", ans);
    }
    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

#define MAX 110
#define INF (1<<29)
typedef pair<int, int> pii;

int d[11][MAX][MAX];

int get_max_block(int M, int N,
                  vector<int> &x, vector<int> &y)
{
    int s = x.size();
    vector<int> cnt(s, 0);
    for (int i = 0; i < M; i++) {
        for (int j = 0; j < N; j++) {
            int mini = INF, mid = -1, c = 0;
            for (int k = 0; k < s; k++) {
                if (d[k][i][j] < mini) {
                    mini = d[k][i][j];
                    c = 1;
                    mid = k;
                } else if (d[k][i][j] == mini) {
                    c++;
                }
            }
            if (c == 1) {
                cnt[mid]++;
            }
        }
    }
    return cnt[s-1];
}

int get_dist(int sx, int sy, int gx, int gy, int M, int N)
{
    queue<pii> Q;
    Q.push(pii(sx, sy));

    vector<vector<int>> md(MAX, vector<int>(MAX, INF));
    md[sy][sx] = 0;

    const int dx[2][6] = {
        {-1, +0, -1, +1, -1, +0},
        {+0, +1, -1, +1, +0, +1}
    };
    const int dy[6] = {-1, -1, +0, +0, +1, +1};
    
    while (!Q.empty()) {
        pii p = Q.front(); Q.pop();
        int x = p.first, y = p.second;
        if (x == gx && y == gy) {
            return md[y][x];
        }

        for (int i = 0; i < 6; i++) {
            int nx = x + dx[y&1][i];
            int ny = y + dy[i];

            if (0 <= nx && nx < M && 0 <= ny && ny < N) {
                if (md[y][x] + 1 < md[ny][nx]) {
                    md[ny][nx] = md[y][x] + 1;
                    Q.push(pii(nx, ny));
                }
            }
        }        
    }
    return INF;
}

int main()
{
    int M, N, s, t;
    while (cin >> M >> N, M) {
        cin >> s;
        vector<int> x(s), y(s);
        for (int i = 0; i < s; i++) {
            cin >> x[i] >> y[i];
            for (int j = 0; j < M; j++) {
                for (int k = 0; k < N; k++) {
                    d[i][j][k] = get_dist(x[i], y[i], j, k, M, N);
                }
            }
        }
        
        int res = 0;
        
        cin >> t;
        for (int i = 0; i < t; i++) {
            int X, Y;
            cin >> X >> Y;
            for (int j = 0; j < M; j++) {
                for (int k = 0; k < N; k++) {
                    d[s][j][k] = get_dist(X, Y, j, k, M, N);
                }
            }
            x.push_back(X); y.push_back(Y);
            res = max(res, get_max_block(M, N, x, y));
            x.pop_back(); y.pop_back();
        }
        cout << res << endl;
    }
    return 0;
}