Pagini recente » Algoritmiada 2009 - Clasament Runda 3, Clasele 5-8 | Cod sursa (job #3244142) | Rating Bogdan Gheorghiu (UnSlayne) | Rating Robert Szarvas (robertkarol) | Cod sursa (job #3282950)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, s[50005], k;
short a[50005];
int main()
{
int i, j, minn, smax = 0, st, dr, p;
fin >> n >> k;
for(i = 1; i <= n; i++)
fin >> a[i];
for(i = 1; i <= n; i++)
s[i] = s[i - 1] + a[i];
smax = s[k]; minn = 0; p = 0; st = 1, dr = k;
for(i = k + 1; i <= n; i++)
{
if(minn > s[i - k])
{
minn = s[i - k];
p = i - k;
}
if(smax < s[i] - minn)
{
st = p + 1;
dr = i;
smax = s[i] - minn;
}
}
fout << st << " " << dr << " " << smax << "\n";
return 0;
}