Cod sursa(job #1498742)
Utilizator | Data | 9 octombrie 2015 00:23:02 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
using namespace std;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int d,i1,j1,x,maxx=-9999999,n,poz;
scanf("%d",&n);
d=0;i1=0;j1=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&x);
if(d+x>x) d=d+x;
else {d=x;poz=i;}
if(d>maxx) {maxx=d;i1=poz;j1=i;}
}
printf("%d %d %d",maxx,i1,j1);
return 0;
}