Cod sursa(job #3131663)
Utilizator | Patrick Burasan patrick_burasan | Data | 20 mai 2023 21:55:30 |
---|---|---|---|
Problema | Secventa 2 | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.74 kb |
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int a[50001];
int main()
{
int N, K, i, s, smax, l, lmax, dr;
in >> N >> K;
for (i = 1; i <= N; ++i)
in >> a[i];
in.close();
s = 0;
smax = 0;
l = 0;
lmax = 0;
for (i = 1; i <= N; ++i)
{
if (s + a[i] >= 0)
{
s += a[i];
l++;
}
else
{
s = 0;
l = 0;
}
if (s > smax && l >= K)
{
smax = s;
lmax = l;
dr = i;
}
}
out << dr - lmax + 1 << ' ' << dr << ' ' << smax << '\n';
out.close();
return 0;
}