Cod sursa(job #2001939)
Utilizator | Data | 18 iulie 2017 10:10:46 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.74 kb |
#include <fstream>
using namespace std;
const int NMAX=6000000;
int v[NMAX+5];//4000020B = 4MB
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
long long n,i,sc,smax,isc,ismax,sfsmax;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
smax=sc=v[1];
isc=ismax=sfsmax=1;
for(i=2;i<=n;i++)
{
if(sc+v[i]<v[i])
{
sc=v[i];
isc=i;
}
else
sc=sc+v[i];
if(sc>smax)
{
smax=sc;
ismax=isc;
sfsmax=i;
}
}
fout<<smax<<" "<<ismax<<" "<<sfsmax<<"\n";
fin.close();
fout.close();
return 0;
}