Pagini recente » Cod sursa (job #277378) | Cod sursa (job #3139520) | Borderou de evaluare (job #53485) | Cod sursa (job #890907) | Cod sursa (job #2627240)
#include <fstream>
#include <deque>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,i,j,m,k,v[500005],mx=-200000000,in,sf;
deque <int> d;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++){
while(!d.empty()&&v[i]<=v[d.back()])
d.pop_back();
d.push_back(i);
if(i-k>=d.front())
d.pop_front();
if(mx<v[d.front()]&&i>=k){
mx=v[d.front()];
sf=i;
in=i-k+1;
}
}
g<<in<<" "<<sf<<" "<<mx;
return 0;
}