Pagini recente » Cod sursa (job #2290485) | Cod sursa (job #1228419) | Cod sursa (job #1867831) | Cod sursa (job #876330) | Cod sursa (job #1184858)
// Problema secv2
#include <stdio.h>
#define MAX 50001
int N[MAX];
long S[MAX];
int main()
{
long n, k, i, sum;
freopen( "secv2.in", "rt", stdin );
scanf( "%ld %ld", &n, &k );
sum = 0;
for( i=0; i<n; i++ ) {
scanf( "%d", &N[0] );
sum += N[i];
S[i] = sum;
}
fclose( stdin );
long max = -MAX;
long p, u, j;
p = 0;
u = 0;
S[0] = N[0];
for( i=k; i<n; i++ )
for( j=0; j<i-k; j++ )
if( S[i] - S[j] > max )
{
max = S[i] - S[j];
p = j+1;
u = i+1;
}
freopen( "secv2.out", "wt", stdout );
printf( "%ld %ld %ld\n", p, u, max );
fclose( stdout );
return 0;
}