Cod sursa(job #260960)
Utilizator | Data | 17 februarie 2009 19:32:42 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | Ascuns |
Compilator | cpp | Status | done |
Runda | Marime | 0.63 kb |
#include <stdio.h>
#define MAXN 7000010
int N, Sol, p1, p2;
int A[MAXN];
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
int i, j, S;
scanf("%d ", &N);
for (i = 1; i <= N; i++) scanf("%d ", &A[i]);
for (i = 1; i <= N; i++)
{
S = 0;
for (j = i; j <= N; j++)
{
S += A[j];
if (S > Sol)
{
Sol = S;
p1 = i;
p2 = j;
}
}
}
printf("%d %d %d\n", Sol, p1, p2);
return 0;
}