Cod sursa(job #642048)
Utilizator | Data | 30 noiembrie 2011 15:21:40 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,j,x,s,smax,pmax,umax,p,u;
int main()
{
f>>n;s=0;smax=0;p=1;
for(i=1;i<=n;i++)
{
f>>x;
if(x+s>=x)
{
s=s+x;
u++;
}
else
{
s=x;
p=i;
u++;
}
if(s>smax)
{
smax=s;
pmax=p;
umax=u;
}
}
g<<smax<<" "<<pmax<<" "<<umax;
return 0;
}