Pagini recente » Cod sursa (job #3315166) | Cod sursa (job #3324062) | Cod sursa (job #3354885) | Cod sursa (job #3314780) | Cod sursa (job #3312293)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
const int DIM = 5e4 + 1;
int n, k;
long long a[DIM], sp[DIM], min_sum[DIM], min_pos[DIM];
int main()
{
fin >> n >> k;
for (int i = 1; i <= n; ++i)
fin >> a[i];
for (int i = 1; i <= n; ++i)
sp[i] = sp[i - 1] + a[i];
for (int i = 1; i <= n; ++i)
if (sp[i] < min_sum[i - 1])
{
min_sum[i] = sp[i];
min_pos[i] = i;
}
else
{
min_sum[i] = min_sum[i - 1];
min_pos[i] = min_pos[i - 1];
}
long long ans(LLONG_MIN);
int st = 1, dr = k;
for (int i = k; i <= n; ++i)
{
long long c = sp[i] - min_sum[i - k];
if (c > ans)
{
ans = c;
dr = i;
st = min_pos[i - k] + 1;
}
}
fout << st << ' ' << dr << ' ' << ans;
return 0;
}