Pagini recente » Cod sursa (job #2770808) | Cod sursa (job #881989) | Cod sursa (job #1882819) | Cod sursa (job #1040107) | Cod sursa (job #916995)
Cod sursa(job #916995)
#include <fstream>
#define INF 0x3f3f3f3f
using namespace std;
const char iname[] = "secv2.in";
const char oname[] = "secv2.out";
ifstream fin(iname);
ofstream fout(oname);
int N, K, i, j, bestSum, minSum, st, dr;
int s[50004];
int main()
{
bestSum = -1 * INF;
fin >> N >> K;
for (i = 1; i <= N; ++i)
{
fin >> s[i];
s[i] += s[i - 1];
if (s[i] < minSum)
minSum = s[i],
st = i;
if (s[i] - minSum > bestSum && i - st + 1 >= K)
bestSum = s[i]- minSum,
dr = i;
}
if (N == K)
{
fout << 1 << ' ' << N << ' ' << s[N] << '\n';
}
else
{
fout << st + 1 << ' ' << dr << ' ' << bestSum << '\n';
}
return 0;
}