昨天ABC的F题代码实现求调

    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++) cin >> a[i], p[a[i]] = i;
    int st;
    for(int i = 1; i <= n; i++)
        if (p[i] - 1 <= m || (n - p[i] + 1) <= m){
            st = i;
            break;
        }
    vector<int> ans, bk, v, t;
    if (p[st] - 1 <= m){
        // 全用删
        ans.push_back(st);
        int last = p[st];
        int tot = m - p[st] + 1;
        for(int i = 1; i <= n; i++){
            if (p[i] > last && p[i] - last - 1 <= tot){
                tot -= p[i] - last - 1;
                ans.push_back(i);
                last = p[i];
            }
        }
        for(int i = last + 1; i <= n; i++) ans.push_back(a[i]);
        while(ans.size() && tot){
            tot--;
            ans.pop_back();
        }
    }
    if ((n - p[st] + 1) <= m){
        // 把1移到前面
        int tot = m - (n - p[st] + 1);
        int last = 0;
        for(int i = 1; i <= n; i++)
            if (p[i] > last && p[i] < p[st] && p[i] - last - 1 <= tot){
                tot -= p[i] - last - 1;
                v.push_back(i);
                last = p[i];
            }
        for(int i = last + 1; i < p[st]; i++) v.push_back(a[i]);
        while(v.size() && tot){
            tot--;
            v.pop_back();
        }
        last = v.empty() ? 0 : *v.begin();
        for(int i = n; i > p[st]; i--)
            if (a[i] < last){
                t.push_back(a[i]);
                last = a[i];
            }
        reverse(t.begin(), t.end());
        bk.push_back(st);
        for(auto x : t) bk.push_back(x);
        for(auto x : v) bk.push_back(x);
        while(bk.size() && tot){
            tot--;
            bk.pop_back();
        }
        if (ans.empty() || bk < ans) ans = bk;
    }
    for(auto x : ans) cout << x << ' ';
    cout << '\n';
}