Cod sursa(job #899857)
Utilizator | Data | 28 februarie 2013 16:40:42 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream in ("ssm.in");
ofstream out("ssm.out");
int v[6000001],n;
int main (){
int i,j,k,smax=0,sc=0,start,end;
in >>n;
for(i=1;i<=n;i++)
in>>v[i];
// cea mai simpla varianta
for(i=1;i<=n;i++){
for(j=i;j<=n;j++){
sc=0;
for(k=i;k<=j;j++){
sc+=v[k];
}
if(sc>smax){
smax=sc;
start=i;
end=j;
}
}
}
out <<smax<<" "<<start<<" "<<end;
}