Pagini recente » Borderou de evaluare (job #1213528) | Borderou de evaluare (job #1082481) | Borderou de evaluare (job #1689024) | Borderou de evaluare (job #1423215) | Cod sursa (job #2005802)
#include <bits/stdc++.h>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int a[500001];
int main()
{
int n, k, i, j, maxim, b;
in >> n >> k;
for(i = 1; i <= n; i++)
in >> a[i];
maxim = a[1] + a[2] + a[3];
for(j = 2; j <= n; j++)
{
if(maxim < (a[j] + a[j + 1] + a[j + 2]))
{
maxim = (a[j] + a[j + 1] + a[j + 2]);
i = j;
}
}
b = min(a[i], a[i + 1]);
out << i << " " << i + 2 << " " << min(b, a[i + 2]) << "\n";
in.close();
out.close();
return 0;
}