摘要：Public Bike Management (30) Link 卡了半天原来是看漏了这句话：If there are more than one shortest path, the one that requires the least number of bikes sent from PBM 阅读全文

摘要：有一个已经按升序排好序的数组，求某个数在数组中出现的下标区间。即，若这个数在数组中出现一次或多次，就给出这个范围。 #include <iostream> using namespace std; const int maxn = 100005; int n, q, x, a[maxn]; int 阅读全文