/*
小米笔试第二题大概题意:给定一个正整数数组(如{1,4,2}),两人轮流从当前数组的两头拿数,拿完为止,
拿到的数之和最大者胜,如果相等则第一个拿的人胜,问第一个拿的人能否获胜?
*/
#include
#include
using namespace std;
void happyMax(vector vec, int& xiaomi, int& dami, int left, int right, int count);
int main()
{
vector vec = {1,1,1,1,5,1,1};
/*int num;
while (cin >> num) {
vec.push_back(num);
}*/
int xiaomi = 0;
int dami = 0;
happyMax(vec, xiaomi, dami, 0, vec.size() - 1, 0);
if (xiaomi >= dami) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
getchar();
return 0;
}
void happyMax(vector vec, int& xiaomi, int& dami, int left, int right, int count)
{
count++;
if (left == right) {
if (count % 2 == 1) {
xiaomi += vec[right];
}
else {
dami += vec[right];
}
return;
}
if (vec[left] > vec[right]) {
if (count % 2 == 1) {
xiaomi += vec[left];
}
else {
dami += vec[left];
}
happyMax(vec, xiaomi, dami, left + 1, right, count);
}
else if (vec[left] < vec[right]) {
if (count % 2 == 1) {
xiaomi += vec[right];
}
else {
dami += vec[right];
}
happyMax(vec, xiaomi, dami, left, right - 1, count);
}
//如果两头的数相等,递归找到对自己最有利的选择
else if (vec[left] = vec[right]) {
if (count % 2 == 1) {
int xiaomi_tmp1 = xiaomi;
int dami_tmp1 = dami;
int xiaomi_tmp2 = xiaomi;
int dami_tmp2 = dami;
xiaomi_tmp1 += vec[left];
happyMax(vec, xiaomi_tmp1, dami_tmp1, left + 1, right, count);
xiaomi_tmp2 += vec[right];
happyMax(vec, xiaomi_tmp2, dami_tmp2, left, right - 1, count);
if (xiaomi_tmp1 >= dami_tmp1)
{
xiaomi += vec[left];
happyMax(vec, xiaomi, dami, left + 1, right, count);
}
else if(xiaomi_tmp2 >= dami_tmp2)
{
xiaomi += vec[right];
happyMax(vec, xiaomi, dami, left, right - 1, count);
}
else
{
xiaomi += vec[left];
happyMax(vec, xiaomi, dami, left + 1, right, count);
}
}
else
{
int xiaomi_tmp1 = xiaomi;
int dami_tmp1 = dami;
int xiaomi_tmp2 = xiaomi;
int dami_tmp2 = dami;
dami_tmp1 += vec[left];
happyMax(vec, xiaomi_tmp1, dami_tmp1, left + 1, right, count);
dami_tmp2 += vec[right];
happyMax(vec, xiaomi_tmp2, dami_tmp2, left, right - 1, count);
if (dami_tmp1 > xiaomi_tmp1)
{
dami += vec[left];
happyMax(vec, xiaomi, dami, left + 1, right, count);
}
else if (dami_tmp2 > xiaomi_tmp2)
{
dami += vec[right];
happyMax(vec, xiaomi, dami, left, right - 1, count);
}
else
{
dami += vec[left];
happyMax(vec, xiaomi, dami, left + 1, right, count);
}
}
}
}