Pagini recente » Cod sursa (job #1951144) | Cod sursa (job #1175150) | Cod sursa (job #1731698) | Cod sursa (job #1961768) | Cod sursa (job #562746)
Cod sursa(job #562746)
#include<fstream>
using namespace std;
int main(){
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k;
f>>n>>k;
int i,j,x;
int max=-30000,in,sf;
int a[n+1][k+1];
for(i=1;i<=n;i++){
f>>x;
a[i][1]=x;
for(j=1;j<k && j<i && i+j<=n;j++){
if(x<a[i-j][j]){
a[i-j][1+j]=x;
}
else{
a[i-j][1+j]=a[i-j][j];
}
if(1+j>=k)
if(max<a[i-j][k]){
max=a[i-j][k];
in=i-j;
sf=in+k-1;
}
}
}
g<<in<<" "<<sf<<" "<<max;
return 0;
}