Cod sursa(job #2118265)
Utilizator | Data | 30 ianuarie 2018 14:00:14 | |
---|---|---|---|
Problema | Secventa | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,st,dr,Max,poz1,poz2,i,a[500001],v[500001];
int main()
{
f>>n>>k;
st=1;dr=0;Max=-30000;
for(i=1;i<=n;i++){
f>>a[i];
while(st<=dr&&a[i]<a[v[dr]])
dr--;
dr++;
v[dr]=i;
if(st<=dr&&v[st]==i-k)
st++;
if(i>=k&&Max<a[v[st]]){
Max=a[v[st]];
poz2=i;
}
}
g<<poz2-k+1<<" "<<poz2<<" "<<Max;
return 0;
}