Cod sursa(job #1612868)
| Utilizator | Data | 25 februarie 2016 07:48:53 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.75 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int a[500001],i,j,k,MAX,MIN,l,pozp,pozu,n;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
MAX=-30001;
for(i=1;i<=n-k+1;i++)
{MIN=a[i];
l=1;
for(j=i+1;j<=n;j++)
if(a[j]<MIN) {if(l>=k)if(MIN>MAX){MAX=MIN;
pozp=i;
pozu=j-1;}
j=n+1;}
else l++;
if(a[n]>=MIN) if(l>=k)if(MIN>MAX){MAX=MIN;
pozp=i;
pozu=n;}}
g<<pozp<<' '<<pozu<<' '<<MAX;
return 0;
}
