Cod sursa(job #2120489)
Utilizator | Data | 2 februarie 2018 15:28:20 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,poz,maxim,st,dr,i;
int v[500001],Deque[500001];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
st=1;
maxim=-30100;
for(i=1;i<=n;i++)
{
while(st<=dr&&v[i]<v[Deque[dr]])
dr--;
Deque[dr++]=i;
if(i-Deque[st]==k)
st++;
if(i>=k&&v[Deque[st]]>maxim)
{
maxim=v[Deque[st]];
poz=i;
}
}
g<<poz-k+1<<" "<<poz<<" "<<maxim;
return 0;
}