Pagini recente » Cod sursa (job #659374) | Cod sursa (job #1772611) | Cod sursa (job #851708) | Cod sursa (job #3266175) | Cod sursa (job #2821990)
#include <fstream>
#include <climits>
using namespace std; //rezolvarea legitima, celelalte-s bune din cauza testelor proaste
ifstream cin("secv2.in");
ofstream cout("secv2.out");
const int NMAX = 100003;
int sp[NMAX];
int main()
{
int n, k, i;
cin >> n >> k;
for (i = 1; i <= k; i++)
{
cin >> sp[i];
sp[i] += sp[i - 1];
}
int sc = sp[k], st1, st = 1, dr = k, ans = sp[k];
for (i = k + 1; i <= n; i++)
{
int x;
cin >> x;
sp[i] = sp[i - 1] + x;
if (sp[i] - sp[i - k] > sc + x)
{
sc = sp[i] - sp[i - k];
st1 = i - k + 1;
}
else
sc += x;
if (ans < sc)
{
ans = sc;
st = st1;
dr = i;
}
}
cout << st << " " << dr << " " << ans;
}