Pagini recente » Cod sursa (job #1993100) | Cod sursa (job #1137772) | Cod sursa (job #591875) | Cod sursa (job #2120890) | Cod sursa (job #1809650)
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
long long inc, sf, n, k, v[50010], smin = 10000000000, smax, incmax, sfmax;
int main()
{
int i, x;
fin >> n >> k;
for (i = 1; i <= n; i++)
{
fin >> x;
v[i] = v[i - 1] + x;
}
inc = 1;
for (sf = k; sf <= n; sf++)
{
if (v[sf] - v[inc - 1] > smax)
{
smax = v[sf] - v[inc - 1];
incmax = inc;
sfmax = sf;
}
if (v[sf - k + 1] < smin)
{
smin = v[sf - k + 1];
inc = sf - k + 2;
}
}
fout << incmax << ' ' << sfmax << ' ' << smax << '\n';
fout.close();
return 0;
}