Pagini recente » Cod sursa (job #2426149) | Cod sursa (job #1097460) | Cod sursa (job #3218172) | Cod sursa (job #1401922) | Cod sursa (job #2302527)
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int sp[50005];
int main()
{
int n, k, i, x, st = 0, stt, dr = 1, s = -1, smax = -2000000000;
in >> n >> k;
for (i = 1; i <= n; ++i)
{
in >> x;
sp[i] = sp[i - 1] + x;
}
for (i = 1; i <= n; ++i)
{
if (i >= k && s + sp[i] - sp[i - 1] < sp[i] - sp[i - k])
{
s = sp[i] - sp[i - k];
st = i - k + 1;
}
else
s += sp[i] - sp[i - 1];
if (i >= k && s > smax)
{
smax = s;
stt = st;
dr = i;
}
}
out << stt << " " << dr << " " << smax;
return 0;
}