Ural 1910. Titan ruins: hidden entrance (Titan ruins Series)

This is the first question in the Titan ruins series and will be updated later.

The principle is to find three numbers connected together to maximize the sum of them. The first number of outputs is the sum of the three numbers, the second number is the position of the middle number. It is very easy.

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}