二、数据结构

二 数据结构

#include <iostream>
#include <vector>
using namespace std;
const int N = 100010;
int a[N];
int find(int x) 
{int l = 0, r = alls.size() - 1;while (l < r) {int mid = l + r >> 1;if (alls[mid] >= x) r = mid;else l = mid + 1;}return l + 1;
}
int main() {int n;cin >> n;while (n--) {scanf("%d", &a[n]);}
}