Cod sursa(job #2206844)
Utilizator | Data | 23 mai 2018 22:20:05 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n, i, j, k, v[5000002], d[5000002], x, p, u, st, dr, maxim;
int main(){
maxim=-20000000;
fin>>n>>k;
d[1]=1;
p=1;
u=1;
for(i=1; i<=n; i++){
fin>>v[i];
}
for(i=2; i<=n; i++){
while(p<=u && v[i]<v[d[u]]){
u--;
}
u++;
d[u]=i;
if(i-d[p]==k){
p++;
}
if(i>=k && maxim<v[d[p]]){
maxim=v[d[p]];
st=d[p];
dr=d[u];
}
}
fout<<st<<" "<<dr<<" "<<maxim;
}