Cod sursa(job #3316135)
| Utilizator | Data | 17 octombrie 2025 15:11:57 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int v[6000001];
int main()
{
long long n,s=0,smax=-200000000000000,st=1,dr=0,a1=0,a2=0;
fin>>n;
for(int i=1;i<=n;++i){
fin>>v[i];
}
for(int i=1;i<=n;++i){
dr=i;
s+=v[i];
if(smax<s){
a1=st;
a2=dr;
smax=s;
}
if(s<0){
s=0;
st=i+1;
}
}
fout<<smax<<' '<<a1<<' '<<a2;
return 0;
}
