Pagini recente » Cod sursa (job #2010503) | Profil MAkaveli | Istoria paginii utilizator/notjude | Cod sursa (job #1576776) | Cod sursa (job #2006872)
#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];
b = min(a[1], a[2]);
maxim = min(b, a[3]);
for(j = 2; j <= n; j++)
{
b = min(a[j], a[j + 1]);
b = min(b, a[j + 2]);
if(b > maxim)
{
i = j;
maxim = b;
}
}
out << i << " " << i + 2 << " " << maxim << "\n";
in.close();
out.close();
return 0;
}