제출 #201405

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
201405		Noam527	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	142 ms	7032 KiB

ho_t1

#include <bits/stdc++.h>
#define finish(x) return cout << x << endl, 0
typedef long long ll;
typedef long double ldb;
const int md = 1e9 + 7;
const ll inf = 4e18;
const int OO = 1;
const int OOO = 1;
using namespace std;

int n;
vector<pair<int, int>> a;
vector<int> b;
vector<int> pre, suf;
vector<int> ans;

int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	cin >> n;
	a.resize(n + 1), b.resize(n);
	pre.resize(n), suf.resize(n);
	ans.resize(n + 1);
	for (int i = 0; i < n + 1; i++)
		cin >> a[i].first, a[i].second = i;
	for (auto &i : b) cin >> i;
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());

	pre[0] = a[0].first - b[0];
	for (int i = 1; i < n; i++)
		pre[i] = max(pre[i - 1], a[i].first - b[i]);
	suf[n - 1] = a[n].first - b[n - 1];
	for (int i = n - 2; i >= 0; i--)
		suf[i] = max(suf[i + 1], a[i + 1].first - b[i]);

	for (int i = 0; i < n + 1; i++) {
		ans[a[i].second] = 0;
		if (i > 0)
			ans[a[i].second] = max(ans[a[i].second], pre[i - 1]);
		if (i < n)
			ans[a[i].second] = max(ans[a[i].second], suf[i]);
	}
	for (const auto &i : ans) cout << i << " "; cout << '\n';
}

컴파일 시 표준 에러 (stderr) 메시지

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:43:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  for (const auto &i : ans) cout << i << " "; cout << '\n';
  ^~~
ho_t1.cpp:43:46: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  for (const auto &i : ans) cout << i << " "; cout << '\n';
                                              ^~~~

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