八皇后问题（模板）

void dfs(int cur,int sum)
{
    if(cur==8)
    {
        if(maxi<sum)
            maxi=sum;
        return ;
    }
    for(int i=0;i<8;i++)
        if(!book[0][i]&&!book[1][cur+i+1]&&!book[2][cur-i+8])
        {
            book[0][i]=book[1][cur+i+1]=book[2][cur-i+8]=1;
            dfs(cur+1,sum+m[cur][i]);
            book[0][i]=book[1][cur+i+1]=book[2][cur-i+8]=0;
        }
}