Pagini recente » Cod sursa (job #2626847) | Cod sursa (job #1749065) | Cod sursa (job #949229) | Cod sursa (job #830210) | Cod sursa (job #710495)
Cod sursa(job #710495)
#include<fstream>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int main(){
long n,k,start=1,end,min,base,i,j;
in >> n >> k;
int A[n];
for(i=0; i<n; i++){
in>>A[i];
}
min=A[0];
for(i=1; i<n-k+1; i++){
if (i==1){
for(j=1;j<k;j++){
if (A[j] < min)
min = A[j];
}
base=min;
}
if (A[i-1]>min){
if (A[k+i] < min)
min=A[k+i];
}
else{
min=A[i];
for(j=i+1; j<k+i; j++)
if (A[j]<min)
min=A[j];
}
if (min>base){
base=min;
start=i+1;
end=k+i;
}
}
out <<start<<" "<<end<<" "<<base;
return 0;
}