破解Carol数组难题：计算不稳定子数组的个数！

```cpp #include <iostream> int main() { int T; std::cin >> T; while (T--) { int n; std::cin >> n; int a[n]; for (int i = 0; i < n; i++) { std::cin >> a[i]; } int count = 0; for (int l = 0; l < n; l++) { for (int r = l + 1; r <= n; r++) { int sum = 0; for (int i = l; i < r - 1; i++) { sum += (a[i] - a[i + 1]); } if (sum!= (a[r - 1] - a[l])) { count++; } } } std::cout << count << std::endl; } return 0; } ``` ######[AI问答 | 225点数解答 | 2025-05-22 13:30:18]