今晚携程笔试，编程AC两道，附代码。

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <sstream>
int maxProfit(vector<int>& prices) {
	int n = prices.size();
	if (n == 0) return 0;
	int maxPro = 0;
	int minPri = prices[0];
	for (int i = 1; i < n; i++)
	{
		minPri = min(minPri, prices[i]);
		maxPro = max(maxPro, prices[i] - minPri);
	}
	return maxPro;
}
int main() {
	string str;
	while (getline(cin,str))
	{
		vector<int> vec;
		string s;
		for (int i = 0; i < str.length(); i++) {
			if (str[i] >= '0' && str[i] <= '9') {
				//vec.push_back(int(str[i] - '0'));
				s = s + str[i];
			}
			else{
				stringstream ss;
				ss << s;
				int n;
				ss >> n;
				vec.push_back(n);
				s = "";
			}
		}
		stringstream ss;
		ss << s;
		int n;
		ss >> n;
		vec.push_back(n);
		cout << maxProfit(vec) << "\n";
	}
	return 0;
}

#include <iostream>
#include <vector>
using namespace std;
//从数组vec中找出num，返回位置下标
int findNum(vector<int> &vec, int num,int left,int right) {
	int start = left;
	int end = right;
	while (start < end) {
		int mid = start + (end - start) / 2;
		if (vec[mid] < num) {
			start = mid + 1;
		}
		if (vec[mid] > num) {
			end = mid - 1;
		}
		if (vec[mid] == num)
			return mid;
	}
        //没找到这个数，那就顺序遍历得出这个数应该插入的位置
	int index = -1;
	int i = 0;
	while (i < vec.size()) {
		if (vec[i] > num)
			break;
		i++;
	}
	return index - i;
}
int main() {
	int x, n;
	while (cin >> x) {
		cin >> n;
		vector<int> vec(n, 0);
		for (int i = 0; i < n; i++) {
			cin >> vec[i];
		}
		cout << findNum(vec, x, 0, n - 1) << "\n";
	}
	return 0;
}