题目描述
blablabla
样例
blablabla
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
java 代码
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[] nums = new int[n];
for (int i=0;i<n;i++){
nums[i] = sc.nextInt();
}
for (int i=0;i<m;i++){
int t = sc.nextInt();
int l = left_bound(t, nums);
int r = right_bound(t, nums);
System.out.println(l + " " + r);
}
}
public static int left_bound(int t, int[] nums){
int l = 0;
int r = nums.length;
while (l < r){
int mid = l + ((r -l )>>1);
if (nums[mid] < t){
l = mid + 1;
} else {
r = mid ;
}
}
if (l < 0 || l >= nums.length || nums[l] != t){
return -1;
}
return l;
}
public static int right_bound(int t, int[] nums){
int l = 0;
int r = nums.length - 1;
while (l < r){
int mid = l + ((r -l )>>1) + 1;
if (nums[mid] <= t){
l = mid;
} else {
r = mid - 1;
}
}
if (l < 0 || l >= nums.length || nums[l] != t){
return -1;
}
return l;
}
}