Pagini recente » Cod sursa (job #208335) | Cod sursa (job #2349292) | Cod sursa (job #674888) | Cod sursa (job #3268199) | Cod sursa (job #3243793)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int main() {
// 5 -2 -4 6 7
// k = 1
long long i, n, sum = 0, sumultime, x, maxim = -9999999999999, k, v[1000005], inceput, poz1, poz2;
fin >> n >> k;
sumultime = 0;
poz1 = 1;
for(i = 1; i <= n; i ++) {
fin >> v[i];
sumultime += v[i];
if(i-k >= 1)
sumultime -= v[i-k];
sum += v[i];
if(sum < sumultime)
{
sum = sumultime;
poz1 = i - k + 1;
}
if(sum > maxim) {
maxim = sum;
poz2 = i;
inceput = poz1;
}
}
fout << inceput << ' ' << poz2 << ' ' << maxim;
return 0;
}