Cod sursa(job #1477665)
| Utilizator | Data | 26 august 2015 17:46:04 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
# include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int v[500001],u,p,d[500001],i,n,k,maxim,x,y;
int main () {
maxim=-30001;
fin>>n>>k;
u=0;
p=1;
for(i=1;i<=n;i++){
fin>>v[i];
while(u>=p&&v[i]<=v[d[u]])
u--;
u++;
d[u]=i;
if(i-d[p]==k)
p++;
if(i>=k&&v[d[p]]>maxim){
maxim=v[d[p]];
x=d[p];
y=d[p]+k-1;
}
}
fout<<x<<" "<<y<<" "<<maxim;
return 0;
}
