Cod sursa(job #2281305)
| Utilizator | Data | 11 noiembrie 2018 21:42:17 | |
|---|---|---|---|
| Problema | Secventa | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
std::ifstream cin("secventa.in");
std::ofstream cout("secventa.out");
#define maxn 500005
int v[maxn],dequ[maxn],n,k,sol=-55555,ind;
int main()
{
int fr=1,bk=0,i;
cin>>n>>k;
for(i=1;i<=n;i++){
cin>>v[i];
while(fr<=bk&&v[i]<v[dequ[bk]])
bk--;
dequ[++bk]=i;
if(i-k==dequ[fr])
fr++;
if(i>=k&&sol<v[dequ[fr]])
sol=v[dequ[fr]],ind=dequ[bk];
}
cout<<ind-k+1<<' '<<ind<<' '<<sol;
return 0;
}
