hdu 5873 思维题

链接：戳这里

Football Games

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Problem Description
A mysterious country will hold a football world championships---Abnormal Cup, attracting football teams and fans from all around the world. This country is so mysterious that none of the information of the games will be open to the public till the end of all the matches. And finally only the score of each team will be announced. 
  
  At the first phase of the championships, teams are divided into M groups using the single round robin rule where one and only one game will be played between each pair of teams within each group. The winner of a game scores 2 points, the loser scores 0, when the game is tied both score 1 point. The schedule of these games are unknown, only the scores of each team in each group are available.
  
  When those games finished, some insider revealed that there were some false scores in some groups. This has aroused great concern among the pubic, so the the Association of Credit Management (ACM) asks you to judge which groups' scores must be false.
 
Input
Multiple test cases, process till end of the input.
  
  For each case, the first line contains a positive integers M, which is the number of groups.
  The i-th of the next M lines begins with a positive integer Bi representing the number of teams in the i-th group, followed by Bi nonnegative integers representing the score of each team in this group.

number of test cases <= 10
M<= 100
B[i]<= 20000
score of each team <= 20000
 
Output
For each test case, output M lines. Output ``F" (without quotes) if the scores in the i-th group must be false, output ``T" (without quotes) otherwise. See samples for detail.
 
Sample Input
2
3 0 5 1
2 1 1
 
Sample Output
F
T

题意：

m个小组，每个小组n支队伍进行比赛，任意两支队伍之间有一场比赛

一场比赛里赢得+2分输的+0分，打平的话每队+1分

先给出每支队伍的得分，判断这些得分是否满足小组比赛的条件

思路：原地址

得分从小到大排序，对于当前i，与之前的i-1支队伍比赛完之后，所有的比赛的总得分至少是(i-1)*i

每场比赛都产生2分，打了(i-1)*i/2场，也就是i*(i-1)分

最后n场的总分为n*(n-1)

代码：

#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<string>#include<vector>#include <ctime>#include<queue>#include<set>#include<map>#include<list>#include<stack>#include<iomanip>#include<cmath>#include<bitset>#define mst(ss,b) memset((ss),(b),sizeof(ss))///#pragma comment(linker, "/STACK:102400000,102400000")typedef long long ll;typedef long double ld;#define INF (1ll<<60)-1#define Max 1e9using namespace std;int T;int a[100100];int main(){    while(scanf("%d",&T)!=EOF){        int n;        for(int cas=1;cas<=T;cas++){            scanf("%d",&n);            for(int i=1;i<=n;i++) scanf("%d",&a[i]);            sort(a+1,a+n+1);            ll sum=0;            int f=0;            for(int i=1;i<=n;i++){                sum+=a[i];                if(sum<1LL*(i-1)*i){                    f=1;                    break;                }            }            if(sum!=1LL*(n-1)*n) f=1;            if(f) printf("F\n");            else printf("T\n");        }    }    return 0;}