Cod sursa(job #542459)
Utilizator | Data | 26 februarie 2011 13:51:38 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream.h>
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,a,u,x,y,n,max,sum,k,p;
int main()
{
f>>n;
max=-1234567891;
for (i=1; i<=n; i++)
{
f>>a;
if (sum+a<a)
{
sum=a;
u=i;
p=i;
}
else
{
sum+=a;
u=i;
}
if ((sum>max))
{
max=sum;
x=p;
y=u;
}
}
g<<max<<" "<<x<<" "<<y;
f.close();
g.close();
return 0;
}