Pagini recente » Cod sursa (job #510257) | Cod sursa (job #1622888) | Cod sursa (job #1793133) | Cod sursa (job #1945197) | Cod sursa (job #3181841)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,x, i, sum,indice_inceput=1,indice_final=1,best_sum=-9999999,minim_inceput;
int v[6000001],minim=0;
int main()
{
fin>>n>>k;
for (int i = 1 ; i<=n;i++){
fin>>x;
v[i]=v[i-1]+x;
}
indice_final=k;
best_sum=v[k];
for (int i = 1+k ; i<=n;i++){
if (v[i]-minim>best_sum) {
best_sum=v[i]-minim , indice_final=i,indice_inceput=minim_inceput+1;
}
if (v[i-k]<minim ) minim = v[i-k],minim_inceput=i-k;
}
fout<<indice_inceput<<" "<<indice_final<<" "<<best_sum;
return 0;
}