Cod sursa(job #272002)
Utilizator | Data | 6 martie 2009 11:43:30 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
int s,smax;
int p,u,i,k,n,x;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
smax=-2000000000;
f>>n; s=0;
p=u=k=i=1;
for(i=1;i<=n;i++)
{f>>x;
if(s<0){s=0;k=i;}
s+=x;
if(s>smax){smax=s;p=k;u=i;}
}
g<<smax<<" "<<p<<" "<<u;
g.close();f.close();
return 0;
}