Submission #895422

#	Time	Username	Problem	Language	Result	Execution time	Memory
895422		Richw818	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	85 ms	10072 KiB

ho_t1

#include <bits/stdc++.h>

using namespace std;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;
  cin >> n;
  vector<int> a(n + 1), b(n);
  for (int i = 0; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> b[i];
  }
  sort(b.begin(), b.end());
  vector<int> ord(n + 1);
  iota(ord.begin(), ord.end(), 0);
  sort(ord.begin(), ord.end(), [&](int x, int y) {
    return a[x] < a[y];
  });
  vector<int> pref(n);
  pref[0] = max(0, a[ord[0]] - b[0]);
  for (int i = 1; i < n; i++) {
    pref[i] = a[ord[i]] - b[i];
    pref[i] = max(pref[i], pref[i - 1]);
  }
  int rmax = 0;
  vector<int> ans(n + 1);
  ans[ord[n]] = pref[n - 1];
  for (int i = n - 1; i >= 0; i--) {
    rmax = max(rmax, a[ord[i + 1]] - b[i]);
    ans[ord[i]] = max(rmax, (i == 0 ? 0 : pref[i - 1]));
  }
  for (int i = 0; i <= n; i++) {
    cout << ans[i] << " \n"[i == n];
  }
  return 0;
}

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 91 / 91