Pagini recente » Borderou de evaluare (job #2534401) | Cod sursa (job #1017910) | Cod sursa (job #2397523) | Cod sursa (job #2252594) | Cod sursa (job #761020)
Cod sursa(job #761020)
# include <iostream>
# include <cstdio>
using namespace std;
int tu[500000];
int main(){
freopen ("secventa.in","r",stdin);
freopen ("secventa.out","w",stdout);
long n,k,i,j,p,u,x,y,z;
int max = -30001,min = 30001;
cin>>n>>k;
for(i=1;i<=n;i++) cin>>tu[i];
for(i=1;i<=n-k+1;i++)
for(j=n;j>=i+k-1;j--){
x=i;
y=j;
min=tu[x];
for(z=x+1;z<=j;z++)
if(min>tu[z])
min=tu[z];
if(max<min){
p=x;
u=y;
max=min;
}
else if(max==min){
if(x<p){
p=x;
u=y;
}
if(x==p && y<u){
p=x;
u=y;
}
}
}
cout<<u<<" "<<p<<" "<<max;
fclose(stdin);
fclose(stdout);
return 0;
}