제출 #1288259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1288259		muhammad-mutahir	Art Exhibition (JOI18_art)	C++20	100 / 100	130 ms	12128 KiB

art

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e6+3;
const int inf = 1e18;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;

 
void solve(int testcase_number){
    cin>>n;
    vector<pii>SA;
    for(int i = 0;i<n;i++){
    	cin>>k>>q;
    	SA.pb({k,q});
    }
    sort(all(SA));
    vector<int>dp(n);
    int ans = SA[0].se;
    dp[0] = SA[0].se;
    for(int i = 1;i<n;i++){
    	dp[i] = max(SA[i].se,dp[i-1]-abs(SA[i].fi-SA[i-1].fi)+SA[i].se);
    	ans = max(ans,dp[i]);
    }
    cout<<ans<<endl;
    // cout<<dp[]
}







signed main(){
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);
    cout << fixed<<setprecision(9);
    
    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

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