Pagini recente » Cod sursa (job #2550850) | Cod sursa (job #753470) | Cod sursa (job #1324802) | Cod sursa (job #3240847) | Cod sursa (job #2180605)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int maxSum, i, n, x, beg, endi, idx, s[50002], k, mini = 0, partiala = -2147483648, begp, endp;
int main()
{
in >> n >> k;
for(i = 1; i <= n; i++) {
in >> s[i];
}
for(i = 1; i <= n; i++) {
s[i] += s[i-1];
if(partiala < s[i] - mini) partiala = s[i] - mini, begp = idx+1, endp = i;
if(i-idx >= k) maxSum = partiala, beg = begp, endi = endp;
if(mini > s[i]) mini = s[i], idx = i;
}
if(n == k) out << "1 " << k << " " << s[n];
else out << beg << " " << endi << " " << maxSum;
in.close(), out.close();
return 0;
}