2016大连网络赛1006

有N 支球队. 每只球队之间两两踢球, 赢得加2分, 平手各加1分, 输的不得分. 现在告诉你每只球队最后的分数, 问这个分数序列是否正确.

#include<iostream>#include<cstdio>#include<algorithm>#include<cstdio>#include<queue>#include<map>#include<set>#include<stack>#include<string>#include<cstring>using namespace std;typedef long long LL;const int maxn =2e4+ 10;LL a[maxn];void solve(){       LL t;       while(scanf("%I64d",&t)!=EOF)       {            while(t--)            {                LL n;                scanf("%lld",&n);                memset(a,0,sizeof(a));                int flag = 0,flag1  = 0,flag2 = 0;                LL ans = 0;                LL ans1 = 0;                for(int i = 1;i<=n;i++)                {                    scanf("%I64d",&a[i]);                    ans1+=a[i];                }                sort(a+1,a+n+1);                for(int i = 1;i<=n-1;i++)                {                    ans+=a[i];                    if(ans>=i*(i-1))                    {                        continue;                    }else                    {                        flag = 1;                    }                }                if(flag==1)                {                    cout<<"F"<<endl;                    continue;                }                   if(ans1!=n*(n-1)) cout<<"F"<<endl;                else cout<<"T"<<endl;            }       }}int main(){    solve();    return 0;}