使用C++实现狗熊岭美人松高度查询功能

```cpp #include <iostream> #include <vector> using namespace std; // 定义二分查找函数，用于查找第一个等于目标值的元素的位置 int findFirst(vector<long long>& trees, long long target) { int left = 0, right = trees.size() - 1; int result = -1; while (left <= right) { int mid = left + (right - left) / 2; if (trees[mid] == target) { result = mid; right = mid - 1; // 继续向左查找 } else if (trees[mid] < target) { left = mid + 1; } else { right = mid - 1; } } return result; } // 定义二分查找函数，用于查找最后一个等于目标值的元素的位置 int findLast(vector<long long>& trees, long long target) { int left = 0, right = trees.size() - 1; int result = -1; while (left <= right) { int mid = left + (right - left) / 2; if (trees[mid] == target) { result = mid; left = mid + 1; // 继续向右查找 } else if (trees[mid] < target) { left = mid + 1; } else { right = mid - 1; } } return result; } int main() { int n, m; cin >> n >> m; vector<long long> trees(n); // 读取每棵美人松的高度 for (int i = 0; i < n; i++) { cin >> trees[i]; } for (int i = 0; i < m; i++) { long long k; cin >> k; int first = findFirst(trees, k); int last = findLast(trees, k); if (first == -1 || last == -1) { cout << 0; } else { cout << last - first + 1; } if (i < m - 1) { cout << " "; } } cout << endl; return 0; } ``` ######[AI问答 | 570点数解答 | 2026-02-25 22:37:46]