Cod sursa(job #2302517)
| Utilizator | Data | 14 decembrie 2018 19:21:52 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.7 kb |
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
long long v[50001];
int main()
{
int n, k, i, a, s = -1, st, dr = 1, poz = 0, MAX = 0;
in >> n >> k;
for (i = 1; i <= n; ++i)
{
in >> a;
v[i] = v[i - 1] + a;
}
for (i = k; i <= n; ++i)
{
if (s + (v[i] - v[i - 1]) < v[i] - v[i - k])
{
s = v[i] - v[i - k];
poz = i - k + 1;
}
else
s += v[i] - v[i - 1];
if (s > MAX)
{
MAX = s;
st = poz;
dr = i;
}
}
out << st << " " << dr << " " << MAX;
return 0;
}
