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