#include <bits/stdc++.h> #define rep(i, a, b) for (int i = a; i < (b); ++i) #define all(x) begin(x), end(x) #define sz(x) (int)(x).size() #define debug std::cout << "hmm" << std::endl; typedef long long ll; typedef std::pair<int, int> pii; typedef std::pair<ll, ll> pll; typedef std::vector<int> vi; typedef std::vector<ll> vl; template <typename T> void print(const T &t) { std::cout << t << ' '; } template <typename T1, typename T2> void print(const std::pair<T1, T2> &t) { std::cout << '{' << t.first << ' ' << t.second << '}'; } template <typename T> void print(const std::vector<T> &t) { for (auto a : t) print(a); std::cout << std::endl; } main() { std::cin.tie(0)->sync_with_stdio(0); std::cin.exceptions(std::cin.failbit); int Z = 1; //std::cin >> Z; while (Z--) { int n; std::cin >> n; std::vector<pll> V(n); for (int i = 0; i < n; i++) { std::cin >> V[i].first; V[i].second = i; } std::sort(all(V)); vi T(n, 0); if (V.back().first != V[0].first) T[V.back().second] = 1; std::vector<pll> S(1, pll{V[0].first, V[0].first}); for (int i = 1; i < n; i++) if (V[i].first == S.back().first) S.back().second += V[i].first; else S.push_back({V[i].first, S.back().second + V[i].first}); for (int i = n - 2; i >= 0; i--) { if (V[i].first == V[0].first) break; int it = std::upper_bound(all(S), pll{V[i].first, LONG_LONG_MAX}) - S.begin() - 1; if (S[it].second > V[i + 1].first) T[V[i].second] = 1; else break; } for (auto a : T) if (a) std::cout << 'T'; else std::cout << 'N'; } }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 | #include <bits/stdc++.h> #define rep(i, a, b) for (int i = a; i < (b); ++i) #define all(x) begin(x), end(x) #define sz(x) (int)(x).size() #define debug std::cout << "hmm" << std::endl; typedef long long ll; typedef std::pair<int, int> pii; typedef std::pair<ll, ll> pll; typedef std::vector<int> vi; typedef std::vector<ll> vl; template <typename T> void print(const T &t) { std::cout << t << ' '; } template <typename T1, typename T2> void print(const std::pair<T1, T2> &t) { std::cout << '{' << t.first << ' ' << t.second << '}'; } template <typename T> void print(const std::vector<T> &t) { for (auto a : t) print(a); std::cout << std::endl; } main() { std::cin.tie(0)->sync_with_stdio(0); std::cin.exceptions(std::cin.failbit); int Z = 1; //std::cin >> Z; while (Z--) { int n; std::cin >> n; std::vector<pll> V(n); for (int i = 0; i < n; i++) { std::cin >> V[i].first; V[i].second = i; } std::sort(all(V)); vi T(n, 0); if (V.back().first != V[0].first) T[V.back().second] = 1; std::vector<pll> S(1, pll{V[0].first, V[0].first}); for (int i = 1; i < n; i++) if (V[i].first == S.back().first) S.back().second += V[i].first; else S.push_back({V[i].first, S.back().second + V[i].first}); for (int i = n - 2; i >= 0; i--) { if (V[i].first == V[0].first) break; int it = std::upper_bound(all(S), pll{V[i].first, LONG_LONG_MAX}) - S.begin() - 1; if (S[it].second > V[i + 1].first) T[V[i].second] = 1; else break; } for (auto a : T) if (a) std::cout << 'T'; else std::cout << 'N'; } } |