Cod sursa(job #2030664)
Utilizator | Data | 1 octombrie 2017 22:27:28 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#define D 6000010
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n,i,k,s,v[D],minim,maxim,st,dr;
int main(){
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
minim=100000000;
maxim=-100000000;
for(i=1;i<=n;i++){
if(s<0){
s=v[i];
st=i;
}
else{
s+=v[i];
if(s>maxim){
maxim=s;
dr=i;
}
if(s<minim){
minim=s;
st=i+1;
}
}
}
fout<<maxim<<" "<<st<<" "<<dr;
}