Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <vector>
- #include <iostream>
- #include <limits>
- using namespace std;
- vector<int> minSuf(vector<int> a) {
- vector<int> ans;
- reverse(a.begin(), a.end());
- for (int i = 0; i < a.size(); i++) {
- if (!i) {
- ans.push_back(a[i]);
- } else {
- ans.push_back(min(a[i], ans[i - 1]));
- }
- }
- reverse(ans.begin(), ans.end());
- return ans;
- }
- // 1 2 0 3 4
- // 1 1
- int main() {
- int t;
- cin >> t;
- while(t--) {
- int n;
- cin >> n;
- vector<int> a(n);
- for (int i = 0; i < n; i++)
- cin >> a[i];
- vector<int> suf = minSuf(a);
- int ans = 0;
- for (int i = 0; i < n - 1; i++) {
- if (a[i] > suf[i + 1])
- ans++;
- }
- cout << ans << endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement