Cycle Game [ZOJ 2686]

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1686

View Code

//存在到0边的奇数步的路，则先手胜
const int MM = 11111;
#define inf 0x3f3f3f3f
#define debug puts("wrong")
typedef long long int64;
int N,M;
int num[MM];

void get_data() {
    int i,j,k;
    scanf("%d",&N);
    for(i=0;i<N;i++) scanf("%d",&num[i]);
}
void solve() {
    int i,j,k,cc=0; bool ff=false;
    for(i=0;i<N;i++) {
        if(num[i]==0) break;
        else cc++;
    }
    if(cc&1) {puts("YES");return;}
    cc=0;
    for(i=N-1;i>=0;i--) {
        if(num[i]==0) break;
        else cc++;
    }
    if(cc&1) puts("YES");
    else puts("NO");
}
int main() {
    int ca; scanf("%d",&ca);
    while(ca--) get_data(),solve();
    return 0;
}

 

转载于:https://www.cnblogs.com/zhang1107/archive/2013/05/06/3063314.html