제출 #377805

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
377805		practice101	Art Exhibition (JOI18_art)	C++14	50 / 100	1077 ms	24812 KiB

art

#include<bits/stdc++.h>
/*
Created By Tornado2004
*/
using namespace std;

#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define imod(a , n) (a % n + n ) % n

#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
#define inF freopen("marathon.in","r",stdin );
#define outF freopen("marathon.out" , "w" , stdout ) ;
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;

#define ll long long
#define logar(x , y) log(x) / log(y)
#define int ll
#define pii pair<int , int >
const int N = 1e5 + 5  , K = 11 , M = N * 4 ;
const ll MOD = 1e9 + 7   , oo = 1e9 , OO = 1e18 , mod = MOD ;
const double pi = acos(-1) , eps = 1e-6 ;

//37
// (a ^ b / c ) % mod = (a ^ b ) % MOD * (c ^ (mod - 2)) % mod
// ريتني اعدم المود
int di[] = {0 , 0 , 1 , -1};
int dj[] = {1 , -1 , 0 , 0};


int32_t main()
{   //inF;
   // inF;outF;
    fastio;

    int n ;
    cin >> n ;

    vector<pair<int , int > > v(n);

    for(auto &it : v)cin >> it.first >> it.second ;

    sort(v.begin() , v.end());
    int cum[n + 10] = {};

    for(int i = 0 ; i < n ; i ++){
        cum[i + 1] = cum[i] + v[i].second ;

    }
    int ans = 0 ;

    for(int i = 0 ; i < n ; i ++){
        for(int j = i ; j < n; j ++){
            ans = max(ans , cum[j + 1] - cum[i] - (v[j].first - v[i].first));

        }
    }


    cout << ans ;

}

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