Cod sursa(job #1279073)
Utilizator | Harhoi Radu RaduH | Data | 29 noiembrie 2014 18:56:35 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.79 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,v[6000000010],s[6000000010],k,maxi=-2147000000,start,stop;
int main()
{
fin>>n;
for(i=0;i<n;i++)
fin>>v[i];
s[0]=v[0];
for(i=1;i<n;i++)
{
if(s[i-1]>=0)
{
s[i]=s[i-1]+v[i];
if(s[i]>maxi)
{
maxi=s[i];
stop=i;
start=k;
}
}
else
{
k=i;
s[i]=v[i];
if(s[i]>maxi)
{
maxi=s[i];
stop=i;
start=k;
}
}
}
fout<<maxi<<" "<<start+1<<" "<<stop+1;
fin.close();
fout.close();
return 0;
}