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