Cod sursa(job #2387230)
Utilizator | Data | 24 martie 2019 14:13:22 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
const int N=6000005;
int n,v[N];
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
int best=v[1];
for(int i=2;i<=n;i++)
{
v[i]=max(v[i-1]+v[i],v[i]);
best=max(best,v[i]);
}
return 0;
}