Cod sursa(job #1174731)
Utilizator | Data | 23 aprilie 2014 19:22:06 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include<fstream>
using namespace std;
int a[60000000];
int main()
{
int n,i,sol,st=1,dr=1;
ifstream fin("ssm.in");
fin>>n;
for (i=1;i<=n;i++)
fin>>a[i];
fin.close();
sol=a[1];
ofstream fout("ssm.out");
for (i=2;i<=n;i++)
{
if (sol+a[i]>a[i])
{
sol+=a[i];
dr++;
}
else {sol=a[i];st=dr=i;}
}
i=dr;
while (i>=st && a[i]<0)
{
sol-=a[i];
dr--;i--;
}
fout<<sol<<" "<<st<<" "<<dr<<"\n";
fout.close();
return 0;
}