제출 #1049780

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1049780		vjudge1	Art Exhibition (JOI18_art)	C++17	100 / 100	103 ms	12168 KiB

art

/*

author: CRISTIANO RONALDO

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
can do: find_by_order, order_of_key

__builtin_clz(x): the number of zeros at the beginning of the number
__builtin_ctz(x): the number of zeros at the end of the number
__builtin_popcount(x): the number of ones in the number
__builtin_parity(x): the parity (even or odd) of the number of ones

mt19937 rng(16);
mt19937 bruh(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rofl(chrono::steady_clock::now().time_since_epoch().count());
*/
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define lv v+v
#define rv v+v+1
#define files freopen("aa.txt", "r", stdin), freopen("aa.txt", "w", stdout)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair <long long, long long>;
using pii = pair <int,int>;
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
long long mod = 998244353;
const ll N = 5e5 + 10;
const ll M = 7e3 + 10;
const ll P = 311;
const ld EPS = 1e-7;
const ll block = 450;
const ll inf = 2e18;
ll n,k,dp[N],ans=0;
pll a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin>>n;
for(ll i = 1; i<=n; i++) {
    cin>>a[i].F>>a[i].S;
}
sort(a+1,a+1+n);
for(ll i = 1; i<=n; i++) {
    dp[i] = max((dp[i-1] - a[i].F) + a[i].S, a[i].S + a[i].F);
    ans = max({(dp[i-1] - a[i].F) + a[i].S, a[i].S , ans});
    dp[i] = max(a[i].S + a[i].F, dp[i-1] + a[i].S);
}
cout<<ans;
return 0;
}
// equal, min, max, 1, random, build
/*

*/

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