Pagini recente » Cod sursa (job #2573312) | Cod sursa (job #1621089) | Cod sursa (job #379085) | Cod sursa (job #117034) | Cod sursa (job #1577321)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const char iname[] = "secv2.in";
const char oname[] = "secv2.out";
unsigned long MAXN = 7000005;
#define FOR(i, a, b) for (int i = (a); i <= (b); ++ i)
#define Max(a, b) ((a) > (b) ? (a) : (b))
int main(void) {
ifstream in(iname);
long n, S, k;
long bestSum = -long(2e9), sum = 0, beg=1, end=1, idx=1;
in >> n>>k;
FOR (i, 1, n) {
in >> S;
if (sum < 0)
sum = S, idx = i;
else
sum += S;
if (bestSum < sum&&k <=i- idx)
bestSum = sum, beg = idx, end = i;
}
ofstream out(oname);
out << beg<<" "<<end<<" "<< bestSum;
in.close(), out.close();
return 0;
}