Submission #207535

#	Time	Username	Problem	Language	Result	Execution time	Memory
207535		Lightning	Art Exhibition (JOI18_art)	C++14	50 / 100	79 ms	12024 KiB

art

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define show(a) cerr << #a <<" -> "<< a <<"\n"
#define fo(a, b, c, d) for(int (a) = (b); (a) <= (c); (a) += (d))
#define foo(a, b, c ,d) for(int (a) = (b); (a) >= (c); (a) -= (d))
#define int ll

const int N = 2e5 + 5;
const int INF = 1e9 + 5;

int n, ans;
pll a[N];

void solve() {
	cin >> n;
	//int sum = 0;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i].F >> a[i].S;
		//sum += a[i].S;
	}
	sort(a + 1, a + n + 1);
	/**ans = sum - (a[n].F - a[1].F);
	int l = 1, r = n;
	while (l < r) {
		if (sum - a[l].S - (a[r].F - a[l+1].F) >= sum - a[r].S - (a[r-1].F - a[l].F)) {
			sum -= a[l].S;
			++l;
			ans = max(ans, sum - (a[r].F - a[l].F));
		}
		else {
			sum -= a[r].S;
			--r;
			ans = max(ans, sum - (a[r].F - a[l].F));
		}
	}**/
	for (int i = 1; i <= n; ++i) {
		int sum = 0;
		for (int j = i; j <= n; ++j) {
			sum += a[j].S;
			ans = max(ans, sum - (a[j].F - a[i].F));		
		}
	}
	cout << ans;
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tt = 1;
	while (tt --) {
		solve();
	}
	return 0;
}
/*
	If you only do what you can do, 
	You will never be more than you are now!
*/

Compilation message (stderr)

art.cpp:75:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  main () {
        ^

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