Cod sursa(job #899837)
Utilizator | Oprea George Alexandru georgealex | Data | 28 februarie 2013 16:36:48 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("smm.out");
int v[60000001],n;
int main(){
int n,i,j,k,smax=0,sc,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;k++)
sc+=v[k];
if(sc>smax){
smax=sc;
start=i;
end=j;
}
}
out<<smax<<" "<<start<<" "<<end;
return 0;
}