Cod sursa(job #1392027)
Utilizator | Data | 18 martie 2015 12:35:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int i,n,x,smax,pmax,umax,k,p;
long long s;
int main()
{
fin>>n;
k=1;
p=1;
for(i=1;i<=n;i++)
{
fin>>x;
s+=x;
if(s>smax){smax=s; pmax=p; umax=i;}
if(s<0){s=0; p=i+1;}
}
fout<<smax<<" "<<pmax<<" "<<umax;
return 0;
}