Cod sursa(job #3293294)
| Utilizator | Data | 11 aprilie 2025 12:49:36 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
#define int long long
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMAX=6e5+5;
int n, v[NMAX], i, best[NMAX], ans, st[NMAX], dr[NMAX], l, r;
signed main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
st[1]=dr[1]=1;
for(i=1; i<=n; i++)
{
if(best[i-1]+v[i]>v[i])
{
best[i]=best[i-1]+v[i];
st[i]=st[i-1];
dr[i]=i;
}
else
{
best[i]=v[i];
st[i]=dr[i]=i;
}
if(ans<best[i])
{
ans=best[i];
l=st[i], r=dr[i];
}
}
fout<<ans<<" "<<l<<" "<<r;
return 0;
}
