ural 1910. Titan Ruins: Hidden Entrance（Titan Ruins系列题目）

1 #include <iostream>
2 #include <vector>
3 using namespace std;
4 int main()
5 {
6     int n;
7     cin >> n;
8     int *a = new int[n+1];
9     for (int i = 1; i <= n; ++i)
10         cin >> a[i];
11     int max = 0;
12     int index = 0;
13     for (int i = 1; i <= n-2; ++i)
14     {
15         int sum = a[i] + a[i+1] + a[i+2];
16         {
17             if (sum > max)
18             {
19                 max = sum;
20                 index = i+1;
21             }
22         }
23     }
24     cout << max << " " << index << endl;
25     return 0;
26 }