小猫跳树高度递减判断C++简单实现

```cpp #include <iostream> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n - 1; i++) { if (a[i] <= a[i + 1]) { cout << "no"; return 0; } } cout << "yes"; return 0; } ``` ######[AI写代码神器 | 131点数解答 | 2026-05-23 22:55:44]