█████████ ████ ███░░░░░███ ░░███ ███ ░░░ ██████ ███████ ██████ ██████ ░███ ███░░███ ███░░███ ███░░███ ███░░███ ░███ ░███ ░███░███ ░███ ░███████ ░███ ░███ ░░███ ███░███ ░███░███ ░███ ░███░░░ ░███ ░███ ░░█████████ ░░██████ ░░████████░░██████ ░░██████ ░░░░░░░░░ ░░░░░░ ░░░░░░░░ ░░░░░░ ░░░░░░

Envío 2271

Problema 0x94 - Subarreglo de máxima suma

  • Autor: Osvaldo
  • Fecha: 2020-12-07 21:20:49 UTC (Hace más de 3 años)
Caso # Resultado Tiempo Memoria
#1
Correcto
0.006 s 1 KBi
#2
Incorrecto
0.007 s 1 KBi
#3
Correcto
0.006 s 2 KBi
#4
Correcto
0.006 s 1 KBi
#5
Correcto
0.006 s 1 KBi
#6
Correcto
0.007 s 1 KBi
#7
Correcto
0.006 s 1 KBi
#8
Correcto
0.005 s 2 KBi
#9
Incorrecto
0.006 s 1 KBi
#10
Correcto
0.008 s 2 KBi
#11
Incorrecto
0.007 s 1 KBi
#12
Incorrecto
0.006 s 1 KBi
#13
Incorrecto
0.005 s 1 KBi
#14
Correcto
0.007 s 2 KBi
#15
Incorrecto
0.005 s 1 KBi
#16
Incorrecto
0.006 s 2 KBi
#17
Correcto
0.022 s 2 KBi
#18
Correcto
0.029 s 3 KBi
#19
Incorrecto
0.03 s 3 KBi
#20
Correcto
0.028 s 3 KBi
#21
Correcto
0.022 s 2 KBi
#22
Incorrecto
0.027 s 3 KBi
#23
Correcto
0.016 s 2 KBi
#24
Correcto
0.018 s 3 KBi
Puntos totales: 63 / 100

Código

#include <bits/stdc++.h>
#define ii              pair<int,int>
#define F               first
#define S               second
#define pb              push_back
#define all(x)          (x).begin(),(x).end()
#define rall(x)         (x).rbegin(),(x).rend()
#define fore(i, a, b)   for(int i = a; i < b; i += 1)
#define forr(i, a)      for(int i = a; i >= 0; i--)
#define sz(s)           int(s.size())
#define cls(a,car)      memset(a,car,sizeof (a))
#define db(x)           cout << #x << " is " << x << '\n'
#define angle(x)        double(x * acos(-1) / 180.0)
using namespace std;
void debug(){cout << endl;}
template<typename T, typename... Args>
void debug(T a, Args... args){cout << a << " "; debug(args...);}
typedef long long   ll;
typedef vector<int> vi;
typedef vector<ii>  vii;
const int N = 5e5 + 5;
const ll mod = 1e9 + 7;
const double E = 1e-7;
const int oo = 1e9;

void solve(){
    int n;
    cin >> n;
    vector<ll> v(n), dp(n, 0);
    for(int i = 0; i < n; i++)cin >> v[i];

    dp[0] = v[0];
    ll best = dp[0];
    for(int i = 1; i < n; i++){
        dp[i] = max(dp[i - 1] + v[i], v[i]);
        best = max(best, dp[i]);
    }
    cout << dp[n - 1] << '\n';
}
int main(){
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #else
       ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #endif

    int t = 1;
    //cin >> t;
    for(int i = 1; i <= t; i++){
        solve();
    }

    #ifdef LOCAL
        cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif
    return 0;
}