Cod sursa(job #3368381)
| Utilizator | Data | 14 octombrie 2026 13:07:43 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMAX=6000001;
int v[NMAX] , dp[NMAX] , n , st , dr;
int main()
{
fin>>n;
for(int i=1 ; i<=n ; i++)
fin>>v[i];
dp[1]=v[1]; ///suma maxima initiala
int ans=dp[1];
for(int i=2 ; i<=n ; i++)
{
dp[i]=max(v[i] , dp[i-1]+v[i]);
ans=max(ans , dp[i]);
if(dp[i-1]<0) ///schimb secventa
st=i;
else if(dp[i]==ans)
dr=i;
}
fout<<ans<<" "<<st<<" "<<dr;
return 0;
}
