Pagini recente » Cod sursa (job #1909101) | Cod sursa (job #2455649) | Cod sursa (job #278005) | Cod sursa (job #3039244) | Cod sursa (job #22885)
Cod sursa(job #22885)
#include<iostream.h>
#include<fstream.h>
main()
{
long int a[500000],min,min2,k,n,i,j,l,r,s,t,x,sp,valid,aux;
fstream f("secventa.in",ios::in);
fstream g("secventa.out",ios::out);
f>>n;
f>>k;
for(i=1;i<=n;i++)
f>>a[i];
i=1;min2=0;min=-31000;
do{
f>>a[i+2];
r=i;
min2=a[r];
r++;
sp=1;
do{
if(a[r]<min2)min2=a[r];
r++;
sp++;
}while(sp<k);
r--;
if(min2>min)
{
min=min2;
valid=(r-k)+1;
}
j++;
i++;
}while(i<=((n-k)+1));
g<<valid<<" ";
g<< ((valid+k)-1)<<" ";
g<<min;
f.close();
g.close();
return 0;
}