Cod sursa(job #1333119)
| Utilizator | Data | 2 februarie 2015 20:25:40 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 55 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
using namespace std;
int n,a[6000010],i,m,s,ic,sf;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d\n",&n);
for (i=1;i<=n; i++)
scanf("%d ",&a[i]);
s=a[1]; m=a[1];
ic=1;
sf=1;
for (i=2; i<=n; i++)
{
s=s+a[i];
if (s<0)
{
ic=i; sf=i; s=a[i];
}
if (s>m)
{
sf=i;
m=s;
}
}
printf("%d %d %d\n",m,ic,sf);
return 0;
}
