Cod sursa(job #3304440)
| Utilizator | Data | 23 iulie 2025 15:44:50 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int v[6000001];
for (int i = 1; i <= n; i++){
cin >> v[i];
}
int suma = 0, sumaMax = 0;
for(int i = 0; i < n; i++)
{
suma = suma + v[i];
if(suma < 0)
suma = 0;
if(suma > sumaMax)
sumaMax = suma;
}
cout << sumaMax;
return 0;
}
