Pagini recente » Cod sursa (job #2466670) | Cod sursa (job #1512971) | Cod sursa (job #2531953) | Cod sursa (job #2855729) | Cod sursa (job #3164808)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int a[500001],sol[5001][2],ok[5001];///sol tine si indicele si val minimului det din fiecare scventa
int main()
{
int n,k,max1=-30001,pozi=1,pozf=1;
fin>>n>>k;
for(int i=1;i<=n;i++){
fin>>a[i];
sol[i][0]=30001;
ok[i]=1;
for(int j=i;j>0;j--){
if(sol[j][0]>a[i]){
if(i-j+1<=k){
sol[j][0]=a[i];
sol[j][1]=i;
} else{
ok[j]=0;
}
}else if(ok[j]==1){
sol[j][1]=i;
}
if(j<=n-k+1 && sol[j][0]>max1){
max1=sol[j][0];
pozi=j;
pozf=sol[j][1];
} else if (max1==sol[j][0]&& pozi==j){
pozf=sol[j][1];
}
}
}
fout<<pozi<<" "<<pozf<<" "<<max1;
return 0;
}