1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <iostream>
using namespace std;
    int array[3][500005];
bool fun(int aUp[500005],int aDown[500005],int m)
{
    for (int i=0;i<m;i++)
    {
        if (i==0&&m!=1)                   //头
        {
            aUp[i+1]=aDown[i]-aUp[i];
        }
        else if (i==m-1)           //尾
        {
            if (aDown[i]==aUp[i]+aUp[i-1])
            {
                return true;
            }
            
        }
        else
        {
            aUp[i+1]=aDown[i]-aUp[i]-aUp[i-1];
        }
        if (aUp[i+1]<0||aUp[i+1]>1)           //地雷数无效（不为1或0）
        {
            return false;
        }
    }
     return false;
}
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX