제출 #747405

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
747405		baluteshih	Mizuyokan 2 (JOI23_mizuyokan2)	C++14	28 / 100	4070 ms	4556 KiB

mizuyokan2

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()
#define pb push_back

int arr[250005], dp[250005];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> arr[i];
    int q;
    cin >> q;
    for (int i = 1; i <= q; ++i) {
        int x, y, a, b;
        cin >> x >> y >> a >> b;
        arr[x] = y;
        int ans = 1;
        ll cur = 0, sum = 0;
        for (int j = a + 1; j <= b; ++j) sum += arr[j];
        for (int j = a + 1; j <= b; ++j) {
            dp[j] = -n;
            if (j == a + 1) dp[j] = 1;
            if (cur > arr[j]) dp[j] = 2;
            ll nw = 0;
            for (int k = j - 1; k > a && k > j - 70; --k) {
                if (nw > arr[k] && nw > arr[j]) dp[j] = max(dp[j], dp[k] + 2);
                nw += arr[k];
            }
            cur += arr[j];
            if (sum - cur > arr[j]) ans = max(ans, dp[j] + 1);
            if (j == b) ans = max(ans, dp[j]);
        }
        cout << ans << "\n";
    }
}

• Subtask 1: 6 / 6
• Subtask 2: 9 / 9
• Subtask 3: 13 / 13
• Subtask 4: 0 / 32
• Subtask 5: 0 / 29
• Subtask 6: 0 / 11