Cod sursa(job #638699)
Utilizator | Data | 21 noiembrie 2011 14:23:57 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream.h>
#include<fstream.h>
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,v[100],smax,st,end,max=v[0];
int main(){
in>>n;
for(int i=1;i<=n;i++) in>>v[i];
for(i=1;i<=n;i++)
for(int j=i;j<n;j++){ int sc=0;
for(int k=i;k<=j;k++)
sc+=v[k];
if(sc>smax){ smax=sc;
st=i;
end=j;
}
}
out<<smax<<" "<<st<<" "<<end;
return 0;
}