Cod sursa(job #1810004)
| Utilizator | Data | 19 noiembrie 2016 15:06:45 | |
|---|---|---|---|
| Problema | Secventa | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <bits/stdc++.h>
#define nmax 500001
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int a[nmax];
deque <int>dq;
int n,k;
int i;
int mi=INT_MIN,st,f;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
{
while(!dq.empty() && a[i]<=a[dq.front()])
dq.pop_front();
dq.push_front(i);
if(!dq.empty() && dq.back()<=i-k)
dq.pop_back();
if(i>=k)
{
if(mi<a[dq.back()])
mi=a[dq.back()],f=i;
}
}
fout<<f-k+1<<" "<<f<<" "<<mi<<"\n";
return 0;
}
