Pagini recente » Cod sursa (job #3366166) | Cod sursa (job #3366876) | Monitorul de evaluare | Cod sursa (job #3366865) | Cod sursa (job #3366864)
#include <fstream>
#include <deque>
using namespace std;
ifstream cin("secventa.in");
ofstream cout("secventa.out");
const int dim= 5e6+ 5;
int v[dim];
deque <int> d;
int main()
{
int n, k, i;
cin >> n>> k;
for(i= 1;i <= n;i++)
cin >> v[i];
int maxi= -1e9, st;
for(i= 1;i <= k;i++){
while(!d.empty() and v[d.back()] > v[i])
d.pop_back();
d.push_back(i);
}
if(v[d.front()] > maxi){
maxi= v[d.front()];
st= d.front();
}
for(i= k+ 1;i <= n;i++){
while(!d.empty() and d.front() < i- k+ 1)
d.pop_front();
while(!d.empty() and v[d.back()] > v[i])
d.pop_back();
d.push_back(i);
if(v[d.front()] > maxi){
maxi= v[d.front()];
st= d.front();
}
}
//cout << endl;
cout << st<<" "<< st+ k- 1<<" "<< maxi;
return 0;
}