Cod sursa(job #751032)
| Utilizator | Data | 23 mai 2012 22:50:42 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
int main () {
int n, v[100006], i, j, s;
freopen ("ssm.in", "r", stdin);
freopen ("ssm.out", "w", stdout);
scanf ("%d", &n);
for (i=1; i<=n; ++i)
scanf ("%d", &v[i]);
int max=0, ci, cj;
for (i=1; i<=n; ++i)
{
s=0;
for (j=i; j<=n; ++j)
{
s=s+v[j];
if (s>max)
{
max=s;
ci=i;
cj=j;
}
}
}
printf ("%d %d %d", max, ci, cj);
}