Pagini recente » Borderou de evaluare (job #1480089) | Rezultatele filtrării | Cod sursa (job #2680799) | Cod sursa (job #2194310) | Cod sursa (job #2564188)
#include <fstream>
using namespace std;
ifstream in ("secv2.in");
ofstream out ("secv2.out");
int n, k;
int v[50137];
int s, smax, st, inc, fin;
int main()
{
in >> n >> k;
st = 1;
for ( register int i = 1 ; i <= n ; ++i )
{
in >> v[i];
if ( v[i] + s >= v[i] )
s += v[i];
else
{
s = v[i];
st = i;
}
if ( s >= smax && i - st + 1 >= k )
{
smax = s;
inc = st;
fin = i;
}
}
out << inc << " " << fin << " " << smax;
return 0;
}