Pagini recente » Cod sursa (job #158094) | Cod sursa (job #1193884) | Cod sursa (job #1848850) | Cod sursa (job #2468374) | Cod sursa (job #1555004)
#include<fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,v[50003],s[50003],i,k,sol1,sol2,minim,maxim,pmin;
int main(){
fin>>n;
fin>>k;
s[0]=0;
for(i=1;i<=n;i++){
fin>>v[i];
s[i]=s[i-1]+v[i];
}
maxim=-750000000;
minim= 750000000;
for(i=k;i<=n;i++){
if(s[i-k]<=minim){
minim=s[i-k];
pmin = i-k;
}
if(s[i] - minim>maxim){
sol1 = pmin+1;
sol2=i;
maxim=s[i]-minim;
}
}
fout<<sol1<<" "<<sol2<<" "<<maxim;
return 0;
}