Pagini recente » Cod sursa (job #442751) | Cod sursa (job #3154438) | Cod sursa (job #2391130) | Cod sursa (job #1512543) | Cod sursa (job #52984)
Cod sursa(job #52984)
#include <stdio.h>
#define NMAX 5001//0
int s[NMAX], max[NMAX], nr[NMAX], n, k;
int maxim = -32000, maxi;
void solve()
{
int i;
scanf("%d %d\n", &n, &k);
for(i = 0; i < n; ++i)
{
scanf("%d ", &s[i]), max[i] = s[i], nr[i] = 1;
if( s[i] + max[i-1] > max[i] )
{
max[i] = max[i-1]+s[i];
nr[i] += nr[i-1];
}
if( (maxim < max[i]) && (k <= nr[i]) )
{
maxim = max[i];
maxi = i;
}
}
}
void write()
{
printf("%d %d %d\n", maxi - nr[maxi] + 2, maxi + 1, maxim);
}
int main()
{
freopen("secv2.in", "r", stdin);
freopen("secv2.out", "w", stdout);
solve();
write();
fclose(stdin);
fclose(stdout);
return 0;
}