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