Cod sursa(job #2497993)
Utilizator | Data | 23 noiembrie 2019 13:16:57 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, i, j, x, sum, s, d, summ, sm, dm;
int main(){
fin>>n;
summ=-1000000000;
for(i=1; i<=n; i++){
fin>>x;
if(sum<0){
sum=x;
s=i;
}else{
sum+=x;
}
if(sum>summ){
summ=sum;
sm=s;
dm=i;
}
}
fout<<summ<<" "<<sm<<" "<<dm;
}