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