Submission #9003108

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define ALL(x) std::begin(x), std::end(x)
using namespace std;

string solve(int n, const vector<int> & a) {
    vector<int> b(n + 1, -1);
    REP (i, n) {
        b[a[i]] = i;
    }

    vector<int> c(n, -1);
    c[a[0]] = 0;
    REP (i, n - 1) {
        c[a[i + 1]] = c[a[i]] + (b[a[i + 1] + 1] < b[a[i] + 1]);
    }
    if (*max_element(ALL(c)) >= 26) {
        return "-1";
    }

    string s(n, '?');
    REP (i, n) {
        s[i] = c[i] + 'A';
    }
    return s;
}

int main() {
    int n; cin >> n;
    vector<int> a(n);
    REP (i, n) {
        cin >> a[i];
        -- a[i];
    }
    cout << solve(n, a) << endl;
    return 0;
}

Submission Info

Judge Result