제출 #747441

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
747441		baluteshih	Mizuyokan 2 (JOI23_mizuyokan2)	C++14	28 / 100	4040 ms	6104 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;

        auto val = [&](int p) {
            if (p <= a || p > b) return 0;
            return arr[p];
        };

        dp[a] = 0;
        for (int j = a + 1; j <= b; ++j) {
            dp[j] = dp[j - 1];
            ll cur = 0;
            for (int k = j; k > a && k > j - 70; --k) {
                cur += arr[k];
                if (cur > max(val(k - 1), val(j + 1))) {
                    if (k == a + 1) dp[j] = max(dp[j], 1);
                    else if (k == a + 2) dp[j] = max(dp[j], 2);
                    else dp[j] = max(dp[j], dp[k - 2] + 2);

                    if (j == b) ans = max(ans, dp[j]);
                    else ans = max(ans, dp[j] + 1);
                    break;
                }
            }
        }
        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