Cod sursa(job #495352)
Utilizator | Data | 24 octombrie 2010 20:00:49 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
int v,i,s,el,maxi=-2000000000,in,sf,n;
int main()
{
ifstream q("ssm.in");
ofstream w("ssm.out");
q>>n;
el=1;
for(i=1;i<=n;i++)
{
q>>v;
s+=v;
if(s>maxi)
{
maxi=s;
in=el;
sf=i;
}
if(s<0)
{
s=0;
el=i;
}
}
w<<maxi<<" "<<in+1<<" "<<sf;
return 0;
}