Pagini recente » Cod sursa (job #2194003) | Cod sursa (job #549987) | Cod sursa (job #2085248) | Cod sursa (job #1519114) | Cod sursa (job #1806928)
#include <fstream>
using namespace std;
int v[500000], d[500000], f=1, e=0, crte=1, crtf=1, n, k;
int best=-300000, bf, be;
int main()
{
ifstream in("secventa.in");
in>>n>>k;
for(int i=0;i<n;i++){
in>>v[i];
while(f <= e && v[d[e]]>v[i]) e--;
d[++e] = i;
if(i-d[f]+1>k)f++;
if(i>=k-1){
if(v[d[f]]>best){
best = v[d[f]];
bf = i-k+2;
be = i+1;
}
}
}
ofstream out("secventa.out");
out<<bf<<" "<<be<<" "<<best;
return 0;
}