Cod sursa(job #1586293)
Utilizator | Data | 31 ianuarie 2016 23:17:06 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
using namespace std;
int n,i,v[1001],s=0,smax=-6000001,p=0,d=0,ss=0;
int main()
{freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&v[i]);
}
for(i=1;i<=n;i++)
{
if(s<0){ s=v[i]; ss=i;}
else
s=s+v[i];
if(smax<s) {smax=s;p=ss;d=i;}
}
printf("%d %d %d",smax,p,d);
return 0;
}