Pagini recente » Cod sursa (job #1003530) | Cod sursa (job #1373799) | Cod sursa (job #1255512) | Cod sursa (job #2843933) | Cod sursa (job #1635216)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int V[50005],SUM[50005];
int main(){
int sum=0,bestSum=-10000000,x,n,dr=1,st=1,k,poz;
in>>n>>k;
for(int i=1;i<=n;i++){
in>>V[i];
SUM[i]=SUM[i-1]+V[i];
}
st=1;
dr=k;
sum=SUM[k-1];
bestSum=SUM[k];
for(int i=k;i<=n;i++){
if(sum+V[i] > SUM[i]-SUM[i-k]){
sum+=V[i];
}
else{
poz=i-k+1;
sum+=SUM[i]-SUM[i-k];
}
if(bestSum<sum){
bestSum=sum;
st=poz;
dr=i;
}
}
out<<st<<" "<<dr<<" "<<bestSum;
return 0;
}