Submission #61570583

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
/*
  any k seq
    how would it look?
    [...........................]
*/
using i64 = long long;
void solve() {
  int n;
  cin >> n;
  vector <int> a (n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  int lo = 0, hi = n;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;

/*
  any k seq
    how would it look?

    [...........................]
*/

using i64 = long long;
void solve() {
  int n;
  cin >> n;

  vector <int> a (n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }

  int lo = 0, hi = n;

  while (hi - lo > 1) {
    int mid = (lo + hi) >> 1;
    bool f = 1;
    for (int i = 0, j = mid; i < mid; ++i) {
      while (j < n and a[i] > a[j] / 2) { j += 1; }
      if (j >= n) { f = 0; break; }
      j += 1;
    }
    if (f) { lo = mid; }
    else hi = mid;
  }

  cout << lo << '\n';
}

int main() {
  ios_base::sync_with_stdio(0);cin.tie(NULL);
  int tests = 1;
  // cin >> tests;
  for (int i = 0; i < tests; ++i) {
    solve();
  }
}

Submission Info

Judge Result