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 <iostream>
#include <string>
#include <vector>
#include <climits>
#include <map>
#include <cstring>
using namespace std;

const int dx[2][6] = {
    {-1, 0, -1, 1, -1, 0},
    {0, 1, -1, 1, 0, 1}
};
const int dy[2][6] = {
    {-1, -1, 0, 0, 1, 1},
    {-1, -1, 0, 0, 1, 1}
};

int m, n;
pair<int,int> bloc[100][100], tmp[100][100];

void dfs(int idx, int x, int y, int dist) {
    if (dist < bloc[y][x].second) {
        bloc[y][x] = make_pair(idx, dist);
        int k = y%2;
        for (int i=0; i<6; ++i) {
            if (0 <= x+dx[k][i] && x+dx[k][i] < m &&
                0 <= y+dy[k][i] && y+dy[k][i] < n) {
                dfs(idx, x+dx[k][i], y+dy[k][i], dist+1);
            }
        }
    } else if (idx != bloc[y][x].first && dist == bloc[y][x].second) {
        bloc[y][x] = make_pair(-1, dist);
    }
}

int main() {
    while (cin >> m >> n, (m || n)) {
        for (int i=0; i<100; ++i) for (int j=0; j<100; ++j) {
            bloc[i][j] = make_pair(INT_MAX, INT_MAX);
        }
        int s;
        cin >> s;
        int x, y;
        for (int i=0; i<s; ++i) {
            cin >> x >> y;
            dfs(i, x-1, y-1, 0);
        }
        int t;
        cin >> t;
        int p, q, res = 0;
        for (int i=0; i<t; ++i) {
            cin >> p >> q;
            memcpy(tmp, bloc, sizeof bloc);
            dfs(s, p-1, q-1, 0);
            int cnt = 0;
            for (int i=0; i<n; ++i) {
                for (int j=0; j<m; ++j) {
                    if (bloc[i][j].first == s) {
                        ++ cnt;
                    }
                }
            }
            res = max(res, cnt);
            memcpy(bloc, tmp, sizeof tmp);
        }
        cout << res << endl;
    }
    return 0;
}