Cod sursa(job #897009)
Utilizator | Data | 27 februarie 2013 18:27:22 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,v[6000000],i,j,s,imax,jmax,maxi;
int main()
{ f>>n;
for (i=1;i<=n;++i) f>>v[i];
for (i=1;i<=n;++i){
s=0;
for(j=i;j<=n;++j) {
s+=v[j];
if (s>maxi) {
maxi=s;
imax=i;
jmax=j;
}
}
}
g<<maxi<<" "<<imax<<" "<<jmax;
return 0;
}