Cod sursa(job #2279483)
Utilizator | razvan boabes razvanboabes | Data | 9 noiembrie 2018 16:53:54 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000005];
int main()
{
int n,i,ic,smax,s,icm,sfm;
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
ic=icm=sfm=1;
s=smax=v[1];
for(i=2;i<=n;i++){
if(s+v[i]>=v[i])
s+=v[i];
else{
s=v[i];
ic=i;
}
if(s>smax){
icm=ic;
sfm=i;
smax=s;
}
}
out<<smax<<" "<<icm<<" "<<sfm;
return 0;
}