Submission #72979

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
72979	2018-08-27 11:54:15	Diuven	Art Exhibition (JOI18_art)	C++14	100 / 100	381 ms	235060 KiB

art

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, int> pli;
const int MX=500010;
int n;
pli P[MX];
ll S[MX], A[MX], ans;
inline ll get(int x){ return S[x]-A[x]; }
int main(){
  ios::sync_with_stdio(0); cin.tie(0);
  cin>>n;
  for(int i=1; i<=n; i++) cin>>P[i].first>>P[i].second;
  sort(P+1, P+n+1);
  for(int i=1; i<=n; i++) A[i]=P[i].first;
  for(int i=1; i<=n; i++) S[i]=S[i-1]+P[i].second;
  vector<int> V;
  for(int i=n; i>=1; i--)
    if(V.empty() || get(V.back())<get(i)) V.push_back(i);
  reverse(V.begin(), V.end());
  for(int i=1, p=0; i<=n; i++){
    while(p+1<(int)V.size() && V[p]<i) p++;
    ans=max(ans, get(V[p])-S[i-1]+A[i]);
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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