shunfurh 于 2017.01.06 23:44 提问

Problem Description
I like playing game with my friend, although sometimes looks pretty naive. Today I invent a new game called LianLianKan. The game is about playing on a number stack.
Now we have a number stack, and we should link and pop the same element pairs from top to bottom. Each time, you can just link the top element with one same-value element. After pop them from stack, all left elements will fall down. Although the game seems to be interesting, it's really naive indeed.

To prove I am a wisdom among my friend, I add an additional rule to the game: for each top element, it can just link with the same-value element whose distance is less than 6 with it.
Before the game, I want to check whether I have a solution to pop all elements in the stack.

Input
There are multiple test cases.
The first line is an integer N indicating the number of elements in the stack initially. (1 <= N <= 1000)
The next line contains N integer ai indicating the elements from bottom to top. (0 <= ai <= 2,000,000,000)

Output
For each test case, output “1” if I can pop all elements; otherwise output “0”.

Sample Input
2 1 1 3 1 1 1 2 1000000 1

Sample Output
1 0 0

1个回答

caozhy      2017.01.06 23:49

JavaScript游戏之连连看连线算法实例
JavaScript游戏之连连看连线算法实例

MFC实现连连看三：消子算法

public class Gamelogic { private final static int UP = 0; private final static int DOWN = 1; private final static int LEFT = 2; private final static int RIGHT = 3; private int ROW;