Pagini recente » Cod sursa (job #1191685) | Cod sursa (job #1420033) | Cod sursa (job #2307858) | Cod sursa (job #2648753) | Cod sursa (job #1577289)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const char iname[] = "secv2.in";
const char oname[] = "secv2.out";
const int 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);
int n, S, k;
int bestSum = -int(2e9), sum = 0, beg,sf, idx;
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+1)
bestSum = sum, beg = idx, sf= i;
}
ofstream out(oname);
out <<beg<<" "<<sf<<" "<<bestSum;
in.close(), out.close();
return 0;
}