Cod sursa(job #2343388)
| Utilizator | Data | 13 februarie 2019 22:37:35 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int n,k,s,smax,indice,inc,sf;
int v[50005];
int main()
{
in>>n>>k;
for (int i = 1; i <= n; ++i)
in>>v[i];
for (int i = 1; i <= n; ++i)
{
if (s < 0)
{
s = v[i];
indice = i;
}
else s += v[i];
if (s > smax)
if (i - indice + 1 >= k)
{
smax = s;
inc = indice;
sf = i;
}
}
out<<inc<<" "<<sf<<" "<<smax;
return 0;
}
