免费午餐问题的引申:
代码如下:
#include <iostream>
#include <vector>
using namespace std;
int total = 0;
vector<int> v1;//原始数据集合
vector<int> v2;//最长不增子序列暂时集合
vector<int> v3;//最长单调递减子序列暂时集合
vector<int> v4;//最长不降子序列暂时集合
vector<int> v5;//最长单调递增子序列暂时集合
//二分法求最长不增子序列关键字下标(>=)
int binarySearch1(int key,int lowIndex,int highIndex)
{
if(lowIndex==highIndex)
{
if(lowIndex == 0 && key>v2[0])
{
return lowIndex;
}
return lowIndex+1;
}
int midIndex = (lowIndex + highIndex + 1)/2;
if(key<=v2[midIndex])
{
return binarySearch1(key,midIndex,highIndex);
}
else
{
return binarySearch1(key,lowIndex,midIndex-1);
}
}
//二分法求最长单调递减子序列关键字下标(>)
int binarySearch2(int key,int lowIndex,int highIndex)
{
if(lowIndex==highIndex)