Cod sursa(job #1279077)
Utilizator | Data | 29 noiembrie 2014 19:01:49 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.75 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[6000010],v[6000010],maxi,i,n,a,b;
int main()
{
fin>>n;
for(i=1 ; i<=n ; ++i)
{
fin>>v[i];
}
s[1]=v[1];
maxi=s[1];
for(i=2 ; i<=n ; ++i)
{
if(s[i-1]<0)
{
s[i]=v[i];
}
else
{
a=i;
s[i]=s[i-1]+v[i];
if(s[i]>=0)
while(s[i]+v[i+1]>=0 && i<=n)
{
++i,s[i]=s[i-1]+v[i];
if(s[i]>maxi)
{
maxi=s[i];
b=i;
}
}
}
}
fout<<maxi<<' '<<a-1<<' '<<b;
return 0;
}