Cod sursa(job #945691)
| Utilizator | Data | 2 mai 2013 16:42:46 | |
|---|---|---|---|
| Problema | Secventa | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int v[500011],deq[500011],n,k;
int maxim=-30001,st,dr;
int main(void){
register int i,j,p,u;
f>>n>>k;
deq[1]=1;
p=u=1;
f>>v[1];
for(i=2;i<=n;i++){
f>>v[i];
while(v[deq[u]]>v[i] && u>=p)
u--;
deq[++u]=i;
if(i-deq[p]==k)
p++;
if(v[deq[p]]>maxim){
maxim=v[deq[p]];
st=deq[p];
dr=deq[u];
}
}
g<<dr-k+1<<" "<<dr<<" "<<maxim;
f.close();
g.close();
return 0;
}