BZOJ1413: [ZJOI2009]取石子游戏

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#define MAXN 100010
using namespace std;
int n,val[MAXN];
inline int read(){
    int date=0,w=1;char c=0;
    while(c<‘0‘||c>‘9‘){if(c==‘-‘)w=-1;c=getchar();}
    while(c>=‘0‘&&c<=‘9‘){date=date*10+c-‘0‘;c=getchar();}
    return date*w;
}
void work(){
    if(abs(val[1]-val[n])<=1)printf("0\n");
    else printf("1\n");
}
void init(){
    n=read();
    for(int i=1;i<=n;i++)val[i]=read();
}
int main(){
    int t=read();
    while(t--){
        init();
        work();
    }
    return 0;
}