Cod sursa(job #1840047)
Utilizator | Data | 3 ianuarie 2017 18:31:37 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int alfa,j,x,p[6000001],d[6000001],n,i,maxim,beta;
int main(){
in>>n;
for(i=1;i<=n;i++){
in>>x;
if(i==1){
d[1]=x;}
p[0]=1;
if(d[i-1]>=0){
d[i]=d[i-1]+x;
p[i]=p[i-1];
}
else
{d[i]=x; p[i]=i;}
}
for(i=1;i<=n;i++){
if(d[i]>maxim){
maxim=d[i];
alfa=i;
beta=p[i];
}
}
out<<maxim<<" "<<beta<<" "<<alfa;
return 0;
}