Cod sursa(job #1473048)
| Utilizator | Data | 18 august 2015 13:57:05 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.7 kb |
#include <fstream>
using namespace std;
int v[50001], mn, best, kMin, limL, limR, n, k;
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f >> n >> k;
for (int i = 1; i <= n; i++)
{
f >> v[i];
v[i] += v[i-1];
}
mn = 0;
best = 0;
kMin = 0;
limL = 0;
limR = 0;
for (int i = 1; i <= n; i++)
{
if (v[i] - mn > best && i - kMin > k-1)
{
best = v[i] - mn;
limL = kMin + 1;
limR = i;
}
if (v[i] < mn)
{
mn = v[i];
kMin = i;
}
}
g << limL << " " << limR << " " << best;
return 0;
}
