Submission #1144276

#	Time	Username	Problem	Language	Result	Execution time	Memory
1144276		tnt	Art Exhibition (JOI18_art)	C++20	50 / 100	1082 ms	11964 KiB

art

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#define pb push_back                    
#define ll long long
#define int long long
//#define sort(all(v)) sort(v.begin(),v.end())

int mod = 998244353;
const int N = 4e5 + 10;
const int inf = 1e9;
int fact[200001];
ll binpow(ll a, ll b){
 if(b == 0) return 1;
 else if(b % 2 == 1) return (a * binpow(a, b - 1)) % mod;
 ll p = binpow(a,b / 2);
 return (p * p) % mod;
}
int p[N];
signed main(){
    //freopen("mootube.in", "r", stdin);
    //freopen("mootube.out", "w", stdout);
    int n;
    cin >> n;
    vector <pair<int,int>> v;
    v.pb({1,1});
    for(int i = 1; i <= n; i++){
        int a,b;
        cin >> a >> b;
        v.pb({a,b});
    }
    sort(v.begin(),v.end());
    vector <int> pr(n + 1);
    int ans = 0;
    for(int i = 1;i <= n; i++){
        pr[i] = pr[i - 1] + v[i].second;
    }
    for(int i = 1; i <= n; i++){
        for(int j = i; j <= n; j++){
            ans = max(ans,(pr[j] - pr[i - 1]) - (v[j].first - v[i].first));
        }
    }
    cout << ans;
}

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