Cod sursa(job #3279933)
Utilizator | Data | 24 februarie 2025 20:29:48 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
//#define int long long
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int32_t main(){
int n,v[6000002],i,j;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
int s=0,smax=0,st,dr,stt,drr;
for(i=1;i<=n;i++){
if(s+v[i]>0){
dr=i;
s+=v[i];
}
else{
st=i+1;
s=0;
}
if(smax<s){
smax=s;
stt=st;
drr=dr;
}
}
fout<<smax<<" " <<stt<<" "<<drr;
}