万万没想到二分,
地址: 二分查找大佬博客
要求余数的最大值很明显a[i]越接近a[j]的倍数则余数越大 ,因此我们将所有的元素从大到小排序 ;
然后枚举a[j]的倍数 ,二分查找小于a[i]倍数的最大值,然后更新余数的最大值。
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
int a[20005];
int binary_find(int l, int r, int val)
{
int mid;
while(l <= r)
{
mid = (l + r) >> 1;
if(a[mid] == val) return mid - 1;
else if(a[mid] > val) r = mid - 1;
else l = mid + 1;
}
return r;
}
int main()
{
int n;
while(scanf("%d",&n) != EOF)
{
for(int i = 0; i < n; i ++)
scanf("%d",&a[i]);
sort(a, a + n);
int maxy = -1;
for(int i = 0; i < n; i ++)
{
if(a[i] || a[i] != a[i - 1])
{
int tmp = 2 * a[i];
while(tmp < a[n - 1])
{
int pos = binary_find(0, n - 1, tmp);
maxy = max(maxy, a[pos] % a[i]);
tmp += a[i];
}
maxy = max(maxy, a[n - 1] % a[i]);
}
}
printf("%d\n",maxy);
}
return 0;
}
关于二分 整理一下网上的各种写法
1 查找最后一个小于key的元素
//1 查找最后一个小于key的元素
int findLastLess(int arr[], int len, int key)
{
int left = 0;
int right = len - 1;
int mid;
while (left <= right) {
mid = (left + right) / 2;
if (key <= arr[mid]) {
right = mid - 1;
} else {
left = mid + 1;
}
}
return right;
}
2 查找第一个大于等于key的元素
//2 查找第一个大于等于key的元素
int findFirstGreaterEqual(int arr[], int len, int key)
{
int left = 0;
int right = len - 1;
int mid;
while (left <= right) {
mid = (left + right) / 2;
if (key <= arr[mid]) {
right = mid - 1;
}
else {
left = mid + 1;
}
}
return left;
}
3 查找最后一个小于等于key的元素
//3 查找最后一个小于等于key的元素
int findLastLessEqual(int arr[], int len, int key)
{
int left = 0;
int right = len - 1;
int mid;
while (left <= right) {
mid = (left + right) / 2;
if (key < arr[mid]) {
right = mid - 1;
} else {
left = mid + 1;
}
}
return right;
}
4 查找第一个大于key的元素
//4 查找第一个大于key的元素
int findFirstGreater(int arr[], int len, int key)
{
int left = 0;
int right = len - 1;
int mid;
while (left <= right) {
mid = (left + right) / 2;
if (key < arr[mid]) {
right = mid - 1;
}
else {
left = mid + 1;
}
}
return left;
}
5 查找第一个与key相等的元素
//5 查找第一个与key相等的元素
int findFirstEqual(int arr[], int len, int key)
{
int left = 0;
int right = len - 1;
int mid;
while (left <= right) {
mid = (left + right) / 2;
if (key <= arr[mid]) {
right = mid - 1;
} else {//arr[mid] < key
left = mid + 1;
}
}
//arr[right] < key <= arr[left]
//right是最后一个小于key的
//left是第一个大于等于key的
if (left < len && arr[left] == key) {
return left;
}
return -1;
}
6 查找最后一个与key相等的元素
//6 查找最后一个与key相等的元素
int findLastEqual(int arr[], int len, int key)
{
int left = 0;
int right = len - 1;
int mid;
while (left <= right) {
mid = (left + right) / 2;
if (key < arr[mid]) {
right = mid - 1;
} else {//arr[mid] <= key
left = mid + 1;
}
}
//arr[right] <= key < arr[left]
//right是最后一个小于等于key的
//left是第一个大于key的
if (right >= 0 && arr[right] == key) {
return right;
}
return -1;
}
地址: 二分查找大佬博客