简答题
偏难
#22124
T1、决斗(duel)
T1、决斗(duel)


答案与解析
正确答案:<pre class="brush:cpp;toolbar:false">#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+10;
int n, x;
struct bj {
int num;
bool flag, gjf;
};
vector<bj> v;
int bs(int k) {
int r = n - 1, l = 0, res = -1;
while (l <= r) {
int mid = l + (r - l) / 2;
if (v[mid].num > k && v[mid].flag == true && v[mid].gjf == true) {
res = mid;
r = mid - 1;
} else l = mid + 1;
}
return res;
}
bool cmp(bj a, bj b) {
return a.num < b.num;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back({x, true, true});
}
sort(v.begin(), v.end(), cmp);
for (int i = 0; i < n - 1; i++) {
int re = bs(v[i].num);
if (re == -1) continue;
else {
v[i].flag = false;
v[re].gjf = false;
}
}
int ans = 0;
for (int i = 0; i < n; i++)
if (v[i].flag == true) ans++;
cout << ans;
return 0;
}</pre>
这道题暂未补解析。