Cod sursa(job #2909469)
| Utilizator | Data | 13 iunie 2022 20:37:53 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | c-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
int n, s, pi, pf, max, ppi;
int ssm(int n)
{
int i, x;
pi = 1;
for (i = 1; i <= n; i++)
{
scanf("%d",&x);
if (s < 0)
{
s = x;
pi = i;
}
else s=s+x;
if (s > max)
{
ppi = pi;
pf = i;
max = s;
}
}
printf("%d %d %d\n",max, ppi, pf);
}
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
ssm(n);
return 0;
}