Cod sursa(job #2109054)
Utilizator | Data | 19 ianuarie 2018 08:14:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n,i,p,u,x,maxim,D[6000001];
int main(){
fin>>n;
for(i=1;i<=n;i++){
fin>>x;
if(x>D[i-1]+x){
D[i]=x;
p=u=i;
}
else
D[i]=D[i-1]+x;
if(D[i]>maxim){
maxim=D[i];
u=i;
}
}
fout<<maxim<<" "<<p<<" "<<u;
return 0;
}