codeforces 558B. Amr and The Large Array 解题报告

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstdlib>
 4 #include <cstring>
 5 #include <algorithm>
 6 using namespace std;
 7 
 8 const int maxn = 1e6 + 5;
 9 int cnt[maxn];
10 int pl[maxn];   // 记录每个数第一次出现的位置
11 
12 int main()
13 {
14     #ifndef ONLINE_JUDGE
15         freopen("in.txt", "r", stdin);
16     #endif // ONLINE_JUDGE
17 
18     int n, a;
19     while (scanf("%d", &n) != EOF) {
20         memset(cnt, 0, sizeof(cnt));
21         memset(pl, 0, sizeof(pl));
22         int max_cnt = 0;
23         int min_dis = 0;
24         int l = 0, r = 0;
25 
26         for (int i = 0; i < n; i++) {
27             scanf("%d", &a);
28 
29             if (!cnt[a]) {
30                 pl[a] = i;
31             }
32             cnt[a]++;
33 
34             if (max_cnt < cnt[a]) {
35                 max_cnt = cnt[a];
36                 l = pl[a], r = i;
37                 min_dis = i - tl;
38             }
39             if (max_cnt == cnt[a] && i-pl[a] < min_dis) {
40                 min_dis = i - pl[a];
41                 l = pl[a];
42                 r = i;
43             }
44         }
45         printf("%d %d\n", l+1, r+1);
46     }
47     return 0;
48 }