Cod sursa(job #1840043)
| Utilizator | Data | 3 ianuarie 2017 18:27:56 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int alfa,j,v[6000001],p[6000001],d[6000001],n,i,maxim,beta;
long long a;
int main(){
in>>n;
for(i=1;i<=n;i++){
in>>v[i];
d[1]=v[1];
p[0]=1;
if(d[i-1]>=0){
d[i]=d[i-1]+v[i];
p[i]=p[i-1];
}
else
{d[i]=v[i]; 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;
}
