Cod sursa(job #1588758)
Utilizator | Data | 3 februarie 2016 16:35:11 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int x[6000000],s[6000000];
int main()
{
int n,i,max1=-2000000,a,b;
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];
a=i;}
else
s[i]=s[i-1]+x[i];
if(s[i]>max1)
{max1=s[i];
b=i;}
}
out<<max1<<" "<<a<<" "<<b;
return 0;
}