#include<bits/stdc++.h> #define vi vector<int> #define vvi vector<vi> #define pii pair<int, int> #define pll pair<ll, ll> #define vii vector<pii> #define vll vector<pll> #define vb vector<bool> #define vvb vector<vb> #define vl vector<ll> #define endl '\n' #define turbo ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); #define pb push_back #define ll long long #define f first #define s second #define mid (l+r)/2 using namespace std; int n; vll v; bool czy(int x) { ll sum = v[x].f; for(int i = 0; i < x; i++) { if(sum > v[i].f) sum+=v[i].f; else return false; } for(int i = x+1; i < n; i++) { if(sum > v[i].f) sum+=v[i].f; else return false; } return true; } int main() { turbo cin >> n; v = vll(n); for(int i = 0; i < n; i++) { cin >> v[i].f; v[i].s = i; } sort(v.begin(), v.end()); vector<char> res(n); int l = 0, r = n; while(l+1!=r) { if(czy(mid)) r = mid; else l = mid; } for(int i = 0; i <= l; i++) res[v[i].s] = 'N'; for(int i = r; i < n; i++) res[v[i].s] = 'T'; for(auto it : res) cout << it; cout << endl; }
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 | #include<bits/stdc++.h> #define vi vector<int> #define vvi vector<vi> #define pii pair<int, int> #define pll pair<ll, ll> #define vii vector<pii> #define vll vector<pll> #define vb vector<bool> #define vvb vector<vb> #define vl vector<ll> #define endl '\n' #define turbo ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); #define pb push_back #define ll long long #define f first #define s second #define mid (l+r)/2 using namespace std; int n; vll v; bool czy(int x) { ll sum = v[x].f; for(int i = 0; i < x; i++) { if(sum > v[i].f) sum+=v[i].f; else return false; } for(int i = x+1; i < n; i++) { if(sum > v[i].f) sum+=v[i].f; else return false; } return true; } int main() { turbo cin >> n; v = vll(n); for(int i = 0; i < n; i++) { cin >> v[i].f; v[i].s = i; } sort(v.begin(), v.end()); vector<char> res(n); int l = 0, r = n; while(l+1!=r) { if(czy(mid)) r = mid; else l = mid; } for(int i = 0; i <= l; i++) res[v[i].s] = 'N'; for(int i = r; i < n; i++) res[v[i].s] = 'T'; for(auto it : res) cout << it; cout << endl; } |