五子棋迷

#include <iostream>
#include <vector>
#include <algorithm>

int findBestMove(int color, const std::vector<int>& board) {
    int n = board.size();
    int mid = n / 2;
    int best_pos = -1;
    int max_length = 0;

    for (int i = 0; i < n; ++i) {
        if (board[i] == 0) {  // 找到空位
            int left = i - 1;
            int right = i + 1;
            int current_length = 1;  // 放置当前颜色的棋子

            // 向左检查
            while (left >= 0 && board[left] == color) {
                current_length++;
                left--;
            }

            // 向右检查
            while (right < n && board[right] == color) {
                current_length++;
                right++;
            }

            // 检查是否超过5个
            if (current_length <= 5 && current_length > max_length) {
                max_length = current_length;
                best_pos = i;
            } else if (current_length == max_length) {
                // 如果有多个相同长度的位置，选择最靠近中间的较小的那个坐标
                if (std::abs(i - mid) < std::abs(best_pos - mid) || (std::abs(i - mid) == std::abs(best_pos - mid) && i < best_pos)) {
                    best_pos = i;
                }
            }
        }
    }

    return best_pos;
}

int main() {
    int color;
    std::cin >> color;

    int n;
    std::cin >> n;
    std::vector<int> board(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> board[i];
    }

    int best_pos = findBestMove(color, board);
    std::cout << best_pos << std::endl;

    return 0;
}