Cod sursa(job #1119669)
Utilizator | Data | 24 februarie 2014 19:18:58 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
# include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,n,ci,cs,Ci,Cs;
int x,s,maxx;
int main ()
{
f>>n;
f>>s; ci=1; cs=2;
for (i=2; i<=n; ++i)
{
f>>x;
if (s+x>=x)
{
s=s+x;
++cs;
}
else {
s=x;
ci=i; cs=i;
}
if (s>maxx) maxx=s,Ci=ci,Cs=cs;
}
g<<maxx<<" "<<Ci<<" "<<Cs<<"\n";
return 0;
}