Mai intai trebuie sa te autentifici.
Cod sursa(job #1534064)
Utilizator | Data | 23 noiembrie 2015 11:27:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,a,b[6000000],maxi=0,inc1,inc2,sf1,sf2;
int main()
{
fin>>n;
b[0]=0;
for (int i=1;i<=n;i++)
{bool o=0;
fin>>a;
if (a>b[i-1]+a)
{
b[i]=a;
inc1=i;
}
else
b[i]=b[i-1]+a;
if (b[i]>maxi)
{
maxi=b[i];
sf2=i;
inc2=inc1;
}
}
fout<<maxi<<' '<<inc2<<' '<<sf2;
return 0;
}