Pagini recente » Cod sursa (job #1857418) | Cod sursa (job #955478) | Cod sursa (job #2606964) | Cod sursa (job #2644207) | Cod sursa (job #1727912)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
const int maxn = 50005;
int v[maxn];
int main()
{
int n, k;
in >> n >> k;
for(int i = 1; i <= n; i++)
in >> v[i];
int smax = v[1];
int sumact = 0;
int st = 0;
int dr = 0;
int x = 0;
for(int i = 1; i <= n; i++)
{
if (sumact < 0)
{
x = i;
sumact = v[i];
}
else
sumact += v[i];
if (smax < sumact && i - x >= k)
smax = sumact, st = x, dr = i;
}
out << st << " " << dr << " " << smax << "\n";
return 0;
}