Cod sursa(job #516082)
Utilizator | elev gigel worstbyte | Data | 23 decembrie 2010 10:45:17 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
#define NM 6000//001
using namespace std;
ifstream in("ssmax.in");
ofstream out("ssmax.out");
int n,v[NM];
int main(){
int i,j,k,smax=0,sc,first=0,last=0;
in>>n;
for(i=1;i<=n;++i)
in>>v[i];
for(i=1;i<=n;++i)
for(j=i;j<=n;++j){
sc=0;
for(k=i;k<=j;++k)
sc+=v[k];
if(sc>smax){
smax=sc;
first=i;
last=j;
}
}
out<<smax<<" "<<first<<" "<<last;
return 0;
}