#include <bits/stdc++.h> using namespace std; pair <long long, long long> a[500000]; bitset <500000> wyn, czy; unordered_map <long long, long long> ile; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for(int i = 0; i < n; ++i) { cin >> a[i].first; a[i].second = i; } sort(a, a+n); long long w = 0; int pos = 0; for(int i = 0; i < n; ++i) { if(a[i-1].first != a[i].first && !czy[a[i].second]) { w += a[i].first; czy[a[i].second] = 1; } while(pos < n && a[pos].first < w) { if(!czy[a[pos].second]) { w += a[pos].first; czy[a[pos].second] = 1; } ++pos; } if(pos == n) wyn[a[i].second] = 1; } for(int i = 0; i < n; ++i) { if(wyn[i]) cout << 'T'; else 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 50 51 52 53 | #include <bits/stdc++.h> using namespace std; pair <long long, long long> a[500000]; bitset <500000> wyn, czy; unordered_map <long long, long long> ile; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for(int i = 0; i < n; ++i) { cin >> a[i].first; a[i].second = i; } sort(a, a+n); long long w = 0; int pos = 0; for(int i = 0; i < n; ++i) { if(a[i-1].first != a[i].first && !czy[a[i].second]) { w += a[i].first; czy[a[i].second] = 1; } while(pos < n && a[pos].first < w) { if(!czy[a[pos].second]) { w += a[pos].first; czy[a[pos].second] = 1; } ++pos; } if(pos == n) wyn[a[i].second] = 1; } for(int i = 0; i < n; ++i) { if(wyn[i]) cout << 'T'; else cout << 'N'; } return 0; } |