Pagini recente » Cod sursa (job #1262555) | Cod sursa (job #1886808) | Cod sursa (job #766173) | Cod sursa (job #1678921) | Cod sursa (job #2204527)
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int i,n,v[5000001],dq[5000001],p,u,k,p1,u1,maxi;
long long S;
int main()
{ f>>n>>k;p=1;u=1;f>>v[1];
dq[p]=1;
for(i=2;i<=n;i++){
f>>v[i];
while(p<=u&&v[i]<=v[dq[u]])
u--;
dq[++u]=i;
if(i-dq[p]>=k)
p++;
if(i>=k){
if(maxi<v[dq[p]]){
maxi=v[dq[p]];
p1=dq[p];
u1=i;
}
}
}
g<<p1<<' '<<u1<<' '<<maxi;
return 0;
}