Cod sursa(job #1529185)
Utilizator | Data | 20 noiembrie 2015 16:29:54 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include<iostream>
#include<fstream>
#define D 500000
using namespace std;
fstream fin("secventa.in",ios::in),fout("secventa.out",ios::out);
int n,k;
short x[D+10],a;
int poz[D+10],pi,pf,maxim=-D,p=1,u=1;
int main()
{
int i,r,j;
fin>>n>>k;
fin>>a;
x[p]=a;
poz[p]=1;
for(i=2;i<=n;i++)
{
fin>>a;
while(p<=u&&x[u]>=a) u--;
x[++u]=a;
poz[u]=i;
while(i-poz[p]+1>=k) p++;
if(i-poz[p]+1>=k&&x[p]>maxim)
{
maxim=x[p];
pi=poz[p];
pf=i;
}
}
fout<<pi<<" "<<pf<<" "<<maxim<<"\n";
return 0;
}