国王游戏
#include<iostream>
#include<vector>
#include<string>
#include <algorithm>
#include <cstring>
using namespace std;
int king_left = 0, king_right = 0;
int minister_number = 0;
int a_front[10005] = {
0};
int *max_gold = new int[5005];
int max_length = 0;
struct minister {
int left_hand;
int right_hand;
int key_word;
};
vector<minister> minister_each;
bool cmp(minister a, minister b) {
return a.key_word < b.key_word;
}
int bigMul(int *temp_a_front, int a_front_szie, int left_hand) {
int give_a_number = a_front_szie;
for (int i = 0; i < a_front_szie; i++) {
temp_a_front[i]