Pagini recente » Cod sursa (job #1241030) | Cod sursa (job #2150982) | Cod sursa (job #1828362) | Cod sursa (job #2357807) | Cod sursa (job #1051676)
#include <fstream>
#include <vector>
#define in "secv2.in"
#define out "secv2.out"
#define LL long long
std :: ifstream f(in);
std :: ofstream g(out);
int N, K;
int beg_of_sum, end_of_sum;
LL Best_Sum = -1000000000000;
int main()
{
f >> N >> K;
int beg = 1, end, sum = 0;
for(int el, i = 1; i <= N; ++i)
{
f >> el;
if(sum >= 0) sum += el;
else sum = el, beg = i;
if(Best_Sum < sum && i - beg + 1 >= K)
{
Best_Sum = sum;
beg_of_sum = beg;
end_of_sum = i;
}
}
g << beg_of_sum << ' ' << end_of_sum << ' ' << Best_Sum << '\n';
g.close();
return 0;
}