PAT A1048(测试点四答案错误)

提供两组测试数据：
5 15
1 16 15 12 20
No Solution


2 12
1 6
No Solution

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 100010;
int coins[maxn] = {0};
int upper_bound(int left, int right, int m) {
	while(left < right){
		int mid = (left + right) / 2;
		if(coins[mid] > m) {
			right = mid;
		} else {
			left = mid + 1;
		}
	}
	return left;
}

int main()
{

	int n, m;
	cin >> n >> m;
	for(int i = 0; i < n; i++) {
		cin >> coins[i];
	}
	sort(coins, coins+n);
	bool flag = true;
	for(int i = 0; i < n; i++) {
		int j = upper_bound(0, n, m - coins[i]);
		if(coins[j-1] == m - coins[i] && j != i) {
			flag = false;
			cout << coins[i] << " " << coins[j-1] << endl;
			break;
		}
	}
	if(flag) cout << "No Solution";
	return 0;
}

这是一个典型的使用二分法的漏洞，如果是在有序序列中查找满足一定条件的元素使用以上二分法写法是完全没有问题
改进后AC：

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 100010;
int coins[maxn] = {0};
int upper_bound(int left, int right, int m) {
	while(left < right){
		int mid = (left + right) / 2;
		if(coins[mid] > m) {
			right = mid;
		} else {
			left = mid + 1;
		}
	}
	return left;
}

int main()
{

	int n, m;
	cin >> n >> m;
	for(int i = 0; i < n; i++) {
		cin >> coins[i];
	}
	sort(coins, coins+n);
	bool flag = true;
	for(int i = 0; i < n; i++) {
		int j = upper_bound(0, n, m - coins[i]);
		if(j > 0 && coins[j-1] == m - coins[i] && j-1 != i) {   // 仅仅修改了这一行
			flag = false;
			cout << coins[i] << " " << coins[j-1] << endl;
			break;
		}
	}
	if(flag) cout << "No Solution";
	return 0;
}

该题是在有序序列中查找一个确定的值，使用二分法解题的话最好还是采用以下写法，万无一失

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 100010;
int coins[maxn] = {0};

int upper_bound(int left, int right, int m) {
	while(left < right){
		int mid = (left + right) / 2;
		if(coins[mid] > m) {
			right = mid - 1;
		} else if(coins[mid] == m){
            return mid;
        } else {
			left = mid + 1;
		}
	}
	return -1;
}

int main()
{
	int n, m;
	cin >> n >> m;
	for(int i = 0; i < n; i++) {
		cin >> coins[i];
	}
	sort(coins, coins+n);
	bool flag = true;
	for(int i = 0; i < n; i++) {
		int j = upper_bound(0, n, m - coins[i]);
		if(j != -1 && j != i) {
			flag = false;
			cout << coins[i] << " " << coins[j] << endl;
			break;
		}
	}
	if(flag) cout << "No Solution";
	return 0;
}