Cod sursa(job #572404)
| Utilizator | Data | 5 aprilie 2011 11:53:25 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <algorithm>
#define Nmax 7000005
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int b[Nmax],n,s,pi,pf,cnt;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>b[i];
int smax=-0x03f3f3f;
for(int i=1;i<=n;i++)
{
if(s<0){
s=b[i];
cnt=i;
}
else
s+=b[i];
if(s>smax)
{
smax=s;
pi=cnt;
pf=i;
}
}
fout<<smax<<" "<<pi<<" "<<pf;
return 0;
}
