没啥好说的,萌新第一次敲题解,dalao帮帮忙 ACcode: #include <map> using namespace std; int x[1005], y[1005]; int n, max_n = 0; int max_num(int b1, int b2) { int cnt = 0; for (int i = 0; i < n; i++) { if (x[i] + y[i] == b1 || y[i] - x[i] == b2) { cnt++; } } return cnt; } int main() { map<int, int> m1, m2...