codeforces 493B.Vasya and Wrestling 解题报告

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstdlib>
 4 #include <cstring>
 5 #include <algorithm>
 6 using namespace std;
 7 
 8 typedef __int64 LL;
 9 const int maxn = 2e5 + 5;
10 int a[maxn], b[maxn];
11 LL sum;
12 
13 int main()
14 {
15     #ifndef ONLINE_JUDGE
16         freopen("in.txt", "r", stdin);
17     #endif // ONLINE_JUDGE
18 
19     int n, in;
20     while (scanf("%d", &n) != EOF)
21     {
22         sum = 0;      
23         int mark;
24         int l1 = 0, l2 = 0;
25 
26         for (int i = 0; i < n; i++)
27         {
28             scanf("%d", &in);
29             sum += in;
30 
31             if (in > 0)
32             {
33                 a[l1++] = in;
34                 mark = 1;
35             }
36             else
37             {
38                 b[l2++] = -in;
39                 mark = 2;
40             }
41         }
42         // 最终的得分不相等
43         if (sum > 0)
44             printf("first\n");
45         else if (sum < 0)
46             printf("second\n");
47         // 最终的得分相等
48         else
49         {
50             int flag = 0;
51 
52             for (int i = 0; i < l1 && i < l2; i++)   // 两条得分序列中至少有一位不相等
53             {
54                 if (a[i] > b[i])
55                 {
56                     flag = 1;
57                     break;
58                 }
59                 else if (a[i] < b[i])
60                 {
61                     flag = 2;
62                     break;
63                 }
64             }
65             
66             if (!flag)   // 两条得分序列相等时，最后得分的那个人获胜
67             {
68                 if (l1 == l2)
69                     printf("%s\n", mark == 1 ? "first" : "second");
70             }
71             else        // 得分序列不相等
72                 printf("%s\n", flag == 1 ? "first" : "second");
73         }
74     }
75     return 0;
76 }