COCI '20 Contest 3 #1 Knjige

    1#include <bits/stdc++.h>
    2using namespace std;
    3using ll = long long;
    4using i128 = __int128;
    5const int inf = 1e9;
    6const ll INF = 2e18; //❄️
    7int main() {
    8    ios::sync_with_stdio(0); cin.tie(0); 
    9    int n; cin >> n;
    10    vector<int> v(n);
    11    stack<int> l, r;
    12    for (int i = 0; i < n; i++) {
    13        cin >> v[i];
    14    }
    15    for (int i = v.size() -1; i >= 0; i--) {
    16        l.push(v[i]);
    17    }
    18    sort(v.begin(), v.end());
    19    int pos = 1;
    20    vector<string> ans;
    21    while (pos <= n) {
    22        int x = v[n - pos];
    23        int sorted = pos - 1;
    24        while (l.top() != x) {
    25            int cur = l.top();
    26            l.pop();
    27            ans.push_back("UZMI L L");
    28            r.push(cur);
    29            ans.push_back("STAVI L D");
    30        }
    31        int hand = l.top();
    32        l.pop();
    33        ans.push_back("UZMI L L");
    34        while (l.size() > sorted) {
    35            int cur = l.top();
    36            l.pop();
    37            ans.push_back("UZMI D L");
    38            r.push(cur);
    39            ans.push_back("STAVI D D");
    40        }
    41        l.push(hand);
    42        ans.push_back("STAVI L L");
    43        while (!r.empty()) {
    44            int cur = r.top();
    45            r.pop();
    46            ans.push_back("UZMI L D");
    47            l.push(cur);
    48            ans.push_back("STAVI L L");
    49        }
    50        pos++;
    51    }
    52    cout << ans.size() << '\n';
    53    for (int i = 0; i < ans.size(); i++) cout << ans[i] << '\n';
    54    return 0;
    55}
    56