Pagini recente » Cod sursa (job #1473804) | Cod sursa (job #566771) | Cod sursa (job #602185) | Cod sursa (job #208294) | Cod sursa (job #2036086)
#include <fstream>
#include <deque>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
deque<int> B;
int n,k,a[5000001];
int vmax,vf,vs;
int main()
{ f>>n>>k;
for(int i=1;i<=n;i++)
{ f>>a[i];
while(!B.empty() and a[B.front()]>a[i])
B.pop_front();
B.push_front(i);
if(!B.empty() and i-B.back()>=k)
B.pop_back();
if(i>=k)
{ if(a[B.back()]>vmax)
{ vmax=a[B.back()];
vf=i;
vs=B.back();
}
}
}
g<<vs<<' '<<vf<<' '<<vmax;
return 0;
}