Cod sursa(job #1260953)
| Utilizator | Data | 11 noiembrie 2014 19:47:00 | |
|---|---|---|---|
| Problema | Secventa | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k,v[5000002],d[5000002],i,p,u,sol=-310000,st,dr;
int main(){
fin>>n>>k;
p=1;
for(i=1;i<=n;i++){
fin>>v[i];
while(p<=u && v[i]<=v[d[u]])
u--;
d[++u]=i;
if(d[p]==i-k)
p++;
if(i>=k && v[d[p]]>sol)
sol=v[d[p]],st=i-k+1;
}
fout<<st<<" "<<st+k-1<<" "<<sol;
fin.close();fout.close();
return 0;
}
