Cod sursa(job #3038064)
Utilizator | Data | 26 martie 2023 19:58:05 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int i, j, n, m, maxim, st, dr, inc, s;
int v[6000002];
int main() {
cin>>n;
for(i=1;i<=n;i++){
cin>>v[i];
}
maxim=-2000000000;
inc=1;
for(i=1;i<=n;i++){
if(s<0){
s=v[i];
inc=i;
}
else
s+=v[i];
if(s>maxim){
maxim=s;
st=inc;
dr=i;
}
}
cout<<maxim<<" "<<st<<" "<<dr;
}