At each round, the computer will give Apollo two integers (. ), and Apollo can do exactly one of the following three actions.has not been selected in all previous rounds, Apollo can select integer. Apollo has cracked the game, and he has known all the candidate numbers of each round before the game starts. Now he wants to know the maximum number of integers he can select with the optimal strategy.I believe it would be very simple question for you, please help Apollo solve this question.
Apollo is playing an interesting computer game. There are N rounds in the game. At each round, the computer will give Apollo two integers ( a_i a i and b_i b i ), and Apollo can do exactly one of the following three actions. Apollo can do nothing. If integer a_i a i has not been selected in all previous rounds, Apollo can select integer a_i a i . If integer b_i b i has not been selected in all previous rounds, Apollo can select integer b_i b i . Apollo has cracked the game, and he has known all the candidate numbers of each round before the game starts. Now he wants to know the maximum number of integers he can select with the optimal strategy. I believe it would be very simple question for you, please help Apollo solve this question.
