Cod sursa(job #2754657)
Utilizator | Data | 26 mai 2021 11:11:42 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, i, st, dr, v[6000001], maxi, s;
int main(){
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
for (i=1;i<= n;i++){
if (v[i]+s>=v[i])
s=v[i]+s;
else{
s=v[i];
st=i;
}
if (s>maxi){
maxi=s;
dr=i;
}
}
fout<<maxi<<" "<<st<<" "<<dr;
return 0;
}