제출 #686468

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
686468		opPO	Bigger segments (IZhO19_segments)	C++17	37 / 100	186 ms	262144 KiB

segments

#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define f first
#define s second
#define pb push_back
#define ld long double
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vec vector

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using oset = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;

mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
const ld eps = 1e-6;
const int mod = 1e9 + 7;
const int oo = 2e9;
const ll OO = 2e18;
const int N = 2e5 + 10;

void solve()
{
    int n;
    cin >> n;
    vec<ll> a(n + 1);
    vec<ll> p(n + 1);
    for (int i = 1; i <= n; i++) cin >> a[i], p[i] = p[i - 1] + a[i];
    vec<vec<int>> dp(n + 1, vec<int>(n + 1, -oo));
    for (int i = 0; i <= n; i++) dp[0][i] = 0;
    auto get = [&](int l, int r) -> ll
    {
        return p[r] - p[l - 1];
    };
    for (int i = 1; i <= n; i++)
    {
        ll sum = 0;
        for (int j = i; j >= 1; j--)
        {
            sum += a[j];
            int l = 1, r = j;
            while (l < r)
            {
                int m = l + r >> 1;
                if (get(m, j - 1) > sum) l = m + 1;
                else r = m;
            }
            dp[i][i - j + 1] = dp[j - 1][j - l] + 1;
        }
        for (int len = 1; len <= n; len++) dp[i][len] = max(dp[i][len], dp[i][len - 1]);
    }
    cout << dp[n][n];
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    solve();
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

segments.cpp: In function 'void solve()':
segments.cpp:52:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   52 |                 int m = l + r >> 1;
      |                         ~~^~~

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 10 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27