UVA 808 Bee Breeding （坐标法）

https://vjudge.net/problem/UVA-808

#include<cmath>
#include<cstdio>
#include<algorithm>
using namespace std;
int dx[]={,-,-,,,};
int dy[]={-,-,,,,};
int s[]={,,,,,};
int x[],y[];
int main()
{
    y[]=-;
    x[]=-; y[]=-;
    x[]=-;
    y[]=;
    x[]=; y[]=;
    int nowd=,nows=,nowx=,nowy=;
    for(int now=;now<=;now++)
    {
        if(nows>s[nowd]) nows=,nowd++;
        if(nowd>=)
        {
            nowd=;
            for(int i=;i<;i++) s[i]++;
        }
        nowx+=dx[nowd];
        nowy+=dy[nowd];
        x[now]=nowx;
        y[now]=nowy;
        nows++;
    }
    int a,b,aa,bb;
    while(scanf("%d%d",&aa,&bb)!=EOF)
    {
        a=aa; b=bb;
        if(!a) return ;
        if(x[a]>x[b]) swap(a,b);
        if(x[a]!=x[b] && y[a]<y[b]) printf("The distance between cells %d and %d is %d.\n",aa,bb,max(x[b]-x[a],y[b]-y[a]));
        else printf("The distance between cells %d and %d is %d.\n",aa,bb,abs(y[a]-y[b])+x[b]-x[a]);
    }
}