Pagini recente » Cod sursa (job #3295729) | Cod sursa (job #1488850) | Cod sursa (job #1363180) | Cod sursa (job #2696386) | Cod sursa (job #710482)
Cod sursa(job #710482)
#include<fstream>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int main(){
long n,k,start,end,min,base;
in >> n >> k;
int A[n];
for(int i=0; i<n; i++){
in>>A[i];
}
min=A[0];
for(int i=1; i<n-k+1; i++){
if (i<k){
for(int 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(int 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;
}