Cod sursa(job #638702)
Utilizator | ionutz shetsans | Data | 21 noiembrie 2011 14:30:48 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,s[100],smax,st,end,sc;
int main(){
int i,j;
in>>n;
for(i=1;i<n;i++)
in>>s[i];
smax=0;
for(i=1;i<n;i++)
for(j=i;j<n;j++){
sc=0;
for(int k=i;k<=j;k++)
sc+=s[k];
if(sc>smax){
smax=sc;
st=i;
end=j;
}
}
out<<smax<<" "<<st<<" "<<end<<endl;
return 0;
}