Pagini recente » Cod sursa (job #2134772) | Cod sursa (job #228736) | Cod sursa (job #2697230) | Monitorul de evaluare | Cod sursa (job #2046129)
#include <fstream>
using namespace std;
ifstream cin("secventa.in");
ofstream cout("secventa.out");
const int DIM = 5000001;
int d[DIM], v[DIM];
int main()
{
int n, k;
cin >> n >> k;
int st = 1, dr = 0, s = 0, maxi = -1, ind1, ind2;
for(int i = 1; i <= n; ++i)
{
cin >> v[i];
if(st <= dr && d[st] == i - k)
{
++st;
}
while(st <= dr && v[i] <= v[d[dr]])
{
--dr;
}
d[++dr] = i;
if(i >= k - 1 )
if(v[d[st]] > maxi)
{
maxi = v[d[st]];
ind1 = d[dr];
ind2 = d[st];
}
}
cout << ind2 << ' ' << ind1 << ' ' << v[ind2];
return 0;
}