Cod sursa(job #1805556)
Utilizator | Data | 13 noiembrie 2016 22:41:38 | |
---|---|---|---|
Problema | Secventa | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream fin ("secventa.in");
ofstream fout ("secventa.out");
short v[500010],minim=-31000;
int n,k,i,D[500010],pozj,p,u;
int main () {
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
p=1;
u=1;
D[1]=1;
for(i=2;i<=n;i++){
while(v[i]<=v[D[u]] && p<=u)
u--;
D[++u]=i;
if(i-D[p]>=k)
p++;
if(i>=k && v[D[p]]>minim){
minim=v[D[p]];
pozj=i;
}
}
fout<<pozj-k+1<<" "<<pozj<<" "<<minim;
}