Pagini recente » Cod sursa (job #597595) | Cod sursa (job #1432958) | Cod sursa (job #1722994) | Cod sursa (job #2919894) | Cod sursa (job #1612870)
#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;}
else if(MIN==MAX) {if(i<pozp) {pozp=i;
pozu=j-1;}
else if(i==pozp) if(j-1<pozu)pozu=j-1;}}
j=n+1;}
else l++;
if(a[n]>=MIN) if(l>=k){if(MIN>MAX){MAX=MIN;
pozp=i;
pozu=j-1;}
else if(MIN==MAX) {if(i<pozp) {pozp=i;
pozu=j-1;}
else if(i==pozp) if(j-1<pozu)pozu=j-1;}}}
g<<pozp<<' '<<pozu<<' '<<MAX;
return 0;
}