Cod sursa(job #1040509)
Utilizator | Data | 24 noiembrie 2013 16:35:27 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream fi("ssm.in");
ofstream fo("ssm.out");
int i,n,S,Smax,j1,j2,x,j11;
int main(){
fi>>n; fi>>x;
S=x; Smax=x; j1=1; j2=1;
for(i=2;i<=n;i++)
{
fi>>x;
S=S+x;
if(S>Smax)
{
j1=j11;
j2=i;
Smax=S;
}
if(S<0)
{
S=0;
j11=i+1;
}
}
fo<<Smax<<" "<<j1<<" "<<j2;
fi.close();
fo.close();
return 0;
}