Cod sursa(job #3284011)
Utilizator | Data | 10 martie 2025 20:37:16 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, x[6000005], i, sum, dp[6000005], ans, val;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>x[i];
for(i=1; i<=n; i++)
{
dp[i]=max(x[i], dp[i-1]+x[i]);
if(ans<dp[i])
{
ans=dp[i];
val=i;
}
}
int cval=val;
fout<<ans<<" ";
while(ans-x[val]>=0)
{
ans-=x[val];
val--;
}
fout<<val<<" "<<cval;
return 0;
}