Cod sursa(job #1643805)
Utilizator | Data | 9 martie 2016 20:20:02 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <cstdio>
using namespace std;
int v[500005],n,i,k,sf,in,dr,stg,max1;
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d %d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
for(i=1;i<=n;i++)
{
stg=i-1;
while(stg>=1&&v[stg]>v[i])
stg--;
stg++;
dr=i+1;
while(dr<=n&&v[dr]>v[i])
dr++;
dr--;
if(v[i]>max1&&dr-stg+1>=k)
{
max1=v[i];
in=stg;
sf=dr;
}
}
printf("%d %d %d ",in,sf,max1);
return 0;
}