Pagini recente » Cod sursa (job #1035374) | Cod sursa (job #1257313) | Cod sursa (job #2366898) | Cod sursa (job #1788246) | Cod sursa (job #2628247)
#include <fstream>
using namespace std;
ifstream fin ("secv2.in");
ofstream fout ("secv2.out");
int n, k, sume[50001], a, sum, maxsum, st, dr, inc;
int main()
{
fin >> n >> k;
for (int i = 1; i <= n; i++) {
fin >> a;
sume[i] += sume[i - 1] + a;
}
maxsum = -25001; inc = 1; dr = k;
sum = maxsum = sume[k];
for (int i = k + 1; i <= n; i++) {
a = sume[i] - sume[i - 1];
if (sum + a < sume[i] - sume[i - k]) {
sum = sume[i] - sume[i - k]; inc = i - k + 1;
}
else
sum += a;
if (sum > maxsum) {
maxsum = sum; st = inc; dr = i;
}
}
fout << st << ' ' << dr << ' ' << maxsum;
return 0;
}