1
2025-08-19 16:44:33
发布于:浙江
1阅读
0回复
0点赞
#include <iostream>
#include <vector>
#include <climits>
#include <cmath>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> points(N);
for (int i = 0; i < N; ++i) {
cin >> points[i].first >> points[i].second;
}
int max_area = 0;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
if (i == j) continue;
if (points[i].second == points[j].second) { // AB parallel to x-axis (y_i = y_j)
for (int k = 0; k < N; ++k) {
if (k == i || k == j) continue;
if (points[i].first == points[k].first) { // AC parallel to y-axis (x_i = x_k)
int area = abs((points[j].first - points[i].first) * (points[k].second - points[i].second));
if (area > max_area) {
max_area = area;
}
}
}
}
}
}
cout << max_area << endl;
return 0;
}
这里空空如也
有帮助,赞一个