Cod sursa(job #1641499)
| Utilizator | Data | 8 martie 2016 23:44:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
long n,v[100000],i,sol,curent,pozstart,pozend,startcurent;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main(){
fin>>n;
curent=0;
sol=0;
for(i=1;i<=n;i++){
fin>>v[i];
if(curent<0){
curent=v[i];
startcurent=i;
}
else
curent=curent+v[i];
if(sol<curent){
pozstart=startcurent;
pozend=i;
}
}
for(i=pozstart;i<pozend;i++){
fout<<v[i]<<" ";
}
return 0;
}
