제출 #1290521

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1290521		opitu	Art Exhibition (JOI18_art)	C++20	100 / 100	453 ms	16072 KiB

art

#include <bits/stdc++.h>
#define int long long
#define iamaperson int main() {\
preprocess();\
int t = 1; while (t--) solve();\
}
using namespace std;

int INF = 9e18+23;

void preprocess() {} // just in case!!!!1

void solve() {
    int n; cin >> n;
    vector<array<int, 2>> x(n); for (auto &[a, b] : x) cin >> a >> b;
    vector<array<int, 2>> dp(1+n, {-INF-1, -INF-1});
    sort(x.begin(), x.end());
    dp[n][0] = -INF;
    dp[n][1] = 0;
    for (int i = n-1; i >= 0; --i) {
        if (i != n-1) {
            dp[i][0] = max(dp[i][0], dp[i+1][1]+x[i][0]+x[i][1]);
            dp[i][1] = max(dp[i][1], dp[i+1][1]+x[i][1]);
        }
        dp[i][0] = max(dp[i][0], dp[i+1][0]);
        dp[i][0] = max(dp[i][0], x[i][1]);
        dp[i][1] = max(dp[i][1], x[i][1]-x[i][0]);
    }
    cout << dp[0][0];
}

#undef int

iamaperson

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50