Cod sursa(job #1588782)
Utilizator | Data | 3 februarie 2016 16:53:39 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int x[6000001],s[6000001];
int main()
{
int n,i,max1=-2000000,a,b,a1,b1;
in>>n;
for(i=1;i<=n;i++)
{in>>x[i];
}
s[1]=x[1];
for(i=1; i<n; i++)
{
if(s[i-1]<0)
{s[i]=x[i];
a1=i;}
else
s[i]=s[i-1]+x[i];
if(s[i]>max1)
{max1=s[i];
b1=i;}
if(s[i]==max1)
{a=a1;
b=b1;
if(i==)}
}
out<<max1<<" "<<a<<" "<<b;
return 0;
}