Cod sursa(job #540970)
| Utilizator | Data | 24 februarie 2011 18:17:00 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,st,dr,a,max1,x,p,u,sum;
int main()
{ f>>n;
st=1;dr=1;p=1;u=1;max1=-1999999999;
for(i=1;i<=n;i++)
{
f>>x;
if(sum+x<x)
{
p=i;u=i;
sum=x;
}
else
{
sum=sum+x;
u=i;
}
if(sum>max1)
{
max1=sum;
st=p;
dr=u;
}
}
g<<max1<<' '<<st<<' '<<dr;
return 0;
}
