#include <bits/stdc++.h> using namespace std; using LL = long long; #define FOR(i, l, r) for(int i = (l); i <= (r); ++i) #define REP(i, n) FOR(i, 0, (n) - 1) #define ssize(x) int(x.size()) template<class A, class B> auto& operator<<(ostream &o, pair<A, B> p) { return o << '(' << p.first << ", " << p.second << ')'; } template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) { o << '{'; int i = 0; for(auto e : x) o << (", ")+2*!i++ << e; return o << '}'; } ostream& operator<<(ostream &o, string &s) { return o << s.data(); } #ifdef DEBUG #define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n' #else #define debug(...) {} #endif int main() { cin.tie(0)->sync_with_stdio(0); int n, x; cin >> n; vector<pair<LL, int> > v(n + 1); FOR(i, 1, n) { cin >> x; v[i] = {x, i}; } sort(v.begin() + 1, v.end()); vector<LL> pref(n + 2); FOR(i, 1, n) pref[i] = pref[i - 1] + v[i].first; vector<char> ans(n + 1, 'N'); for (int i = n; i > 0; i--) { if (v[i].first == v[1].first || 2 * pref[i] <= pref[i + 1]) break; ans[v[i].second] = 'T'; } FOR(i, 1, n) cout << ans[i]; cout << '\n'; return 0; }
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 | #include <bits/stdc++.h> using namespace std; using LL = long long; #define FOR(i, l, r) for(int i = (l); i <= (r); ++i) #define REP(i, n) FOR(i, 0, (n) - 1) #define ssize(x) int(x.size()) template<class A, class B> auto& operator<<(ostream &o, pair<A, B> p) { return o << '(' << p.first << ", " << p.second << ')'; } template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) { o << '{'; int i = 0; for(auto e : x) o << (", ")+2*!i++ << e; return o << '}'; } ostream& operator<<(ostream &o, string &s) { return o << s.data(); } #ifdef DEBUG #define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n' #else #define debug(...) {} #endif int main() { cin.tie(0)->sync_with_stdio(0); int n, x; cin >> n; vector<pair<LL, int> > v(n + 1); FOR(i, 1, n) { cin >> x; v[i] = {x, i}; } sort(v.begin() + 1, v.end()); vector<LL> pref(n + 2); FOR(i, 1, n) pref[i] = pref[i - 1] + v[i].first; vector<char> ans(n + 1, 'N'); for (int i = n; i > 0; i--) { if (v[i].first == v[1].first || 2 * pref[i] <= pref[i + 1]) break; ans[v[i].second] = 'T'; } FOR(i, 1, n) cout << ans[i]; cout << '\n'; return 0; } |