Pagini recente » Cod sursa (job #3361692) | Cod sursa (job #3361698) | Cod sursa (job #3361353) | Monitorul de evaluare | Cod sursa (job #3361674)
#include <iostream>
#include <fstream>
using namespace std;
const int mx = 100000;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
long long v[mx + 5], Smax = -2000000000, sum[mx + 5], s = -1, start, len, k;
int n, st, dr;
int main()
{
fin >> n >> k;
sum[0] = 0;
for (int i = 1; i <= n; ++i)
{
fin >> v[i];
sum[i] = sum[i - 1] + v[i];
}
for (int i = 1; i <= n; ++i)
{
if (s < 0)
{
s = 0;
len = 0;
start = i;
}
++len;
s += v[i];
if (s > Smax && len >= k)
{
Smax = s;
st = start;
dr = i;
}
}
fout << st << " " << dr << " " << Smax;
}