Pagini recente » Cod sursa (job #332564) | Cod sursa (job #607025) | Monitorul de evaluare | Cod sursa (job #1152279) | Cod sursa (job #503491)
Cod sursa(job #503491)
#include<iostream.h>
#include<fstream.h>
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,a[100],i,p=0,q=0,b[100],j,max=0,r=0,s=0,c[100];
int fc(int x,int y){int min=100;
for(i=x;i<=y;i++)
if(min>a[i])min=a[i];
return min;}
int main(){
f>>n;f>>k;
for(i=1;i<=n;i++)f>>a[i];
p=-1;
while(p<=n-k+1){
b[q++]=fc(1+p,k+p);
p++;}
for(i=1;i<=q;i++)
if(b[i]>max)max=b[i];
for(i=1;i<=q;i++)if(a[i]==max){r=i;break;}
g<<r<<" "<<r+k-1<<" "<<max;
}