Cod sursa(job #1247724)
Utilizator | Data | 23 octombrie 2014 15:09:32 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,v1,v2,x,z,a[6000001],b[6000001];
int main()
{
f>>n; v1=1; v2=0; z=1;
for(i=1;i<=n;i++)
{
f>>x;
if(a[i-1]<0) {a[i]=x; z=i;}
else a[i]=a[i-1]+x;
if(a[i]>b[i-1]) {b[i]=a[i]; v1=z; v2=i;}
else b[i]=b[i-1];
}
g<<b[n]<<" "<<v1<<" "<<v2;
return 0;
}