Submission #895775

#	Time	Username	Problem	Language	Result	Execution time	Memory
895775		Minbaev	Art Exhibition (JOI18_art)	C++17	50 / 100	1049 ms	20764 KiB

art

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define f first
#define s second
#define pii pair<int,int>
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
const int mod= 1e17 +7;
const int N=1e5*4;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}
void solve(){
	int n,m,k;
	
	cin>>n;
	
	vector<pii>v;
	
	for(int i = 1;i<=n;i++){
		cin>>m>>k;
		v.pb({m,k});
	}
	
	sort(all(v));
	int ans = -1 * mod;
	for(int i = 0;i<n;i++){
		int sum = 0;
		int mn = mod,mx = -1 * mod;
		for(int j = i;j<n;j++){
			sum += v[j].s;
			umax(mx,v[j].f);
			umin(mn,v[j].f);
			umax(ans,sum - (mx-mn));
		}
	}
	cout<<ans;
	
	
}

 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();

}
	

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