fork(1) download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
  5.  
  6. #define int long long
  7. #define pb push_back
  8. #define ff first
  9. #define ss second
  10. #define all(x) (x).begin(), (x).end()
  11. #define rall(x) (x).rbegin(), (x).rend()
  12. #define sz(x) ((int)(x).size())
  13. #define endl '\n'
  14. #define yes cout << "yes\n"
  15. #define no cout << "no\n"
  16.  
  17. #define rep(i,a,b) for(int i=a;i<b;++i)
  18. #define per(i,a,b) for(int i=b-1;i>=a;--i)
  19. #define each(x, a) for (auto& x : a)
  20.  
  21. const int INF = 1e18;
  22. const int MOD = 1e9+7;
  23. const int N = 2e5 + 5;
  24.  
  25. int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
  26. int lcm(int a, int b) { return (a / gcd(a, b)) * b; }
  27.  
  28. int power(int a, int b, int m = MOD) {
  29.     int res = 1;
  30.     while (b > 0) {
  31.         if (b & 1) res = res * a % m;
  32.         a = a * a % m;
  33.         b >>= 1;
  34.     }
  35.     return res;
  36. }
  37.  
  38. int modinv(int a, int m = MOD) {
  39.     return power(a, m - 2, m);
  40. }
  41.  
  42. void solve() {
  43.     int n;
  44.     cin >> n;
  45.     vector<int> b(n);
  46.     vector<int> positive_b;
  47.     rep(i, 0, n) {
  48.         cin >> b[i];
  49.         if (b[i] > 0) {
  50.             positive_b.pb(b[i]);
  51.         }
  52.     }
  53.  
  54.     // Sort the positive elements in ascending order: b'_1 <= b'_2 <= ...
  55.     sort(all(positive_b));
  56.  
  57.     int max_len = 0;
  58.     int m = sz(positive_b);
  59.  
  60.     // Iterate through the constraints k = 1 to m
  61.     rep(k_idx, 0, m) {
  62.         int k = k_idx + 1; // k is the count of smallest positive elements
  63.         int b_prime_k = positive_b[k_idx]; // b'_k is the value of the k-th smallest element
  64.  
  65.         // Max length x must satisfy x >= ceil(k / b'_k)
  66.         // ceil(a/b) = (a + b - 1) / b
  67.         int len = (k + b_prime_k - 1) / b_prime_k;
  68.         max_len = max(max_len, len);
  69.     }
  70.  
  71.     cout << max_len << endl;
  72. }
  73.  
  74. int32_t main() {
  75.     fast_io;
  76.  
  77.     int t;
  78.     cin >> t;
  79.     while (t--) {
  80.         solve();
  81.     }
  82.  
  83.     return 0;
  84. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
3
5
0 5 1 0 1
3
3 2 1
5
1 1 1 1 1
stdout
copy 
2
1
5
https://ideone.com/xrGP8N
language:
C++ (gcc 8.3)
created:
7 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!