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