Cod sursa(job #495342)
Utilizator | Data | 24 octombrie 2010 19:45:57 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <fstream>
using namespace std;
int v,i,s,el1,el2,maxi=-2000000000,in,sf,n;
int main()
{
ifstream q("ssm.in");
ofstream w("ssm.out");
q>>n;
q>>v;
s=v;
el1=1;
for(i=2;i<=n;i++)
{
q>>v;
if(s+v>v)
{
s=s+v;
if(s>maxi)
{
maxi=s;
in=el1;
sf=i;
}
}
else
{
s=v;
el2=i;
if(s>maxi)
{
maxi=s;
in=el2;
sf=i;
}
}
el1=el2;
}
w<<maxi<<" "<<in<<" "<<sf;
return 0;
}