求解数组中不稳定子数组数量：算法实现与示例代码

```cpp #include <iostream> using namespace std; int main() { int T; cin >> T; while (T--) { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } int ans = 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])) { ans++; } } } cout << ans << endl; } return 0; } ``` ######[AI问答 | 220点数解答 | 2025-05-22 13:46:03]