Cod sursa(job #1630548)
| Utilizator | Data | 5 martie 2016 10:01:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <cstdio>
using namespace std;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
long int n, a, s, smax, i, pozmax, pozmin;
scanf("%ld", &n);
smax=0;
s=0;
pozmin=0;
pozmax=0;
for(i=0;i<n;i++)
{
scanf("%ld", &a);
if(s>0)
s=s+a;
else
{
s=a;
pozmin=i;
}
if(s>smax)
{
smax=s;
pozmax=i;
}
}
printf("%ld %ld %ld", smax, pozmin+1, pozmax+1);
return 0;
}
