提出 #60991544

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define ll long long
#define pii pair <ll, ll>
using namespace std;
const int N = 4e5 + 10;
ll x[N], h[N];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	int n; cin >> n;
	for (int i = 1; i <= n; ++i)
		cin >> x[i] >> h[i];
	if (n == 1) {
		cout << "0.00000000";
		return 0;
	}
	long double ans = -1e18;
	ll ansfz = 0, ansfm = 0;
	priority_queue <pii> q;
	for (int i = 1; i <= n; ++i) {
		if (i != 1) {
			while (!q.empty()) {
				ll tmp = q.top().first;
				ll pos = q.top().second; q.pop();
				ll now_fz = h[pos] * (x[pos] - x[i]) - x[pos] * (h[pos] - h[i]);
				ll now_fm = x[pos] - x[i];
				if (ansfm == 0 || now_fz * ansfm > ansfz * now_fm) {
					ansfz = now_fz, ansfm = now_fm; 
					if (q.top().first != tmp) break;
				}
			}
		}
		q.push({h[i], i});
	}
	ans = ansfz * 1.0 / ansfm;
	if (ans < 0) {
		cout << "-1";
		return 0;
	}
	if (ans == 0) {
		cout << "0.000000000000000000000000";
		return 0;
	}
	cout << fixed << setprecision(20) << ans;
	// Why : Wa 1 ????
	return 0;
}

提出情報

ジャッジ結果