螺旋队列算法分析

http://blog.csdn.net/yhmhappy2006/article/details/2934435

 

 

//
//  main.c
//  MyCTest
//
//  Created by gloria on 12-12-30.
//  Copyright (c) 2012年 gloria. All rights reserved.
//

#include <stdio.h>
#define max(a,b)(a>b?a:b)

int main(int argc, const char * argv[])
{
/* 螺旋队列 */
#if 1
    int x=0,y=0;//x,y坐标
    int maxnum=0,max_xy=0,answer=0;
    //maxnum：坐标所在圈的最大数，max_xy：xy中的最大值，answer坐标对应的数
    while (1) {
        printf("start\n");
        scanf("%d,%d",&x,&y);
        getchar();
        max_xy=max(x,y);
        maxnum=(max_xy*2+1)*(max_xy*2+1);
        printf("maxxy=%d,maxnum＝%d\n",max_xy,maxnum);
        if(x==y){
            answer=maxnum;
        }
        else if(y==max_xy){
            answer=maxnum+(-5*y-x);
        }
        else if(x==-max_xy){
            answer=maxnum+(3*x-y);
        }
        else if(y==-max_xy){
            answer=maxnum+(x+y);
        }
        else {
            answer=maxnum+(-7*x+y);
        }
        printf("answer＝%d\n",answer);
    }
#endif
    return 0;
}