Cod sursa(job #2906341)
Utilizator | Sodinca Iulia Cristiana bucketlover413 | Data | 25 mai 2022 18:19:55 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n, nr[1000001], dp[1000001], dpmax=0;
fin>>n;
fin>>nr[1];
dp[1]=nr[1];
dpmax=dp[1];
for(int i=2; i<=n; i++)
{
fin>>nr[i];
if(dp[i-1]>0)
dp[i]=dp[i-1]+nr[i];
else
dp[i]=nr[i];
if(dp[i]>dpmax)
dpmax=dp[i];
}
fout<<dpmax;
return 0;
}