Cod sursa(job #549962)
Utilizator | Data | 9 martie 2011 08:46:19 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int s,mx,p,u,st,dr,i,n,x;
int main()
{
f>>n;
mx=-2147483647;
s=-1;
for(i=1;i<=n;i++)
{
f>>x;
if(s<0)
{
s=x;
st=i;
}
else s+=x;
if(s>mx)
{
mx=s;
p=st;
u=i;
}
}
g<<mx<<' '<<p<<' '<<u<<'\n';
return 0;
}