Pagini recente » Cod sursa (job #831074) | Cod sursa (job #1213335) | Cod sursa (job #575521) | Cod sursa (job #2888142) | Cod sursa (job #52999)
Cod sursa(job #52999)
#include <stdio.h>
#define NMAX 50010
long long a[NMAX];
long long n, k;
long long st, dr, suma = -125000000;
void read()
{
long long i, x;
scanf("%lld %lld\n", &n, &k);
for(i = 1; i <= n; ++i)
{
scanf("%ld ", &x);
a[i] = a[i-1] + x;
}
}
void solve()
{
long long i, j;
for(i = 1; i <= n; ++i)
{
for(j = i; j <= n; ++j)
{
if(a[j]-a[i-1] >= suma && j-i+1 >= k)
{
dr = j;
st = i;
suma = a[j] - a[i-1];
}
}
}
}
int main()
{
freopen("secv2.in", "r", stdin);
freopen("secv2.out", "w", stdout);
read();
solve();
printf("%lld %lld %lld\n", st, dr, suma);
fclose(stdin);
fclose(stdout);
return 0;
}