Pagini recente » Cod sursa (job #616552) | Cod sursa (job #1390449) | Cod sursa (job #1843225) | Cod sursa (job #2952146) | Cod sursa (job #2202591)
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int i,n,k,dq[500001],v[500001],sf,l,p,u,maxi;
int main()
{ f>>n>>k;p=1;u=1;
dq[p]=1;
for(i=1;i<=n;i++){
f>>v[i];
while(v[i]<v[dq[u]])
u--;
dq[++u]=i;
if(i-dq[p]+1>=k){
if(maxi<v[dq[p]]){
maxi=v[dq[p]];
l=i-dq[p]+1;
sf=i;
}
p++;
}
}
g<<sf-l+1<<' '<<sf<<' '<<maxi;
return 0;
}