Pagini recente » Cod sursa (job #1775802) | Cod sursa (job #1245139) | Cod sursa (job #1192753) | Cod sursa (job #1342316) | Cod sursa (job #1658097)
#include <fstream>
#include <algorithm>
#define NMAX 50005
#define inf 2000000000
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int i, n, best = -inf, s = -inf, v[NMAX], sp[NMAX], st, dr, k, stc;
int main()
{
f >> n >> k;
for (i = 1; i <= n; ++ i)
{
f >> v[i];
sp[i] = sp[i - 1] + v[i];
}
s = best = sp[k];
st = 1;
dr = k;
for (i = k + 1; i <= n; ++ i)
{
if (sp[i] - sp[i - k] > s + v[i])
{
stc = i - k + 1;
s = sp[i] - sp[i - k];
}
else
s += v[i];
if (s > best)
{
best = s;
st = stc;
dr = i;
}
}
g << st << " " << dr << " " << best << '\n';
return 0;
}