三角棋盘上的N皇后

#include<set>
#include<map>
#include<vector>
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 9+9;
int n, ans, fg[N];
bool f[30], g[30], p[30];
char c[N][N];
vector<int>q;
set< vector<int> >t;
int Mabs(int x)
{
    return x<0?-x:x;
}
void judge(int sum)
{
    if(sum < ans) return;
    if(sum > ans)
        ans = sum,
        t.clear();
    t.insert(q);
    return;

}
void dfs(int r, int sum)
{
    if(r > n)
    {
        judge(sum);
        return;
    }
    for(int i = 1; i <= r; i++)
        if(!f[r] && !g[i] && !p[Mabs(r-i)])
        {
            f[r] = 1; g[i] = 1; p[Mabs(r-i)] = 1;
            q.push_back(r*(r-1)/2+i);
            dfs(r+1, sum+1);
            q.pop_back();
            f[r] = 0; g[i] = 0; p[Mabs(r-i)] = 0;
        }
    dfs(r+1, sum);
}
int main()
{
    scanf("%d", &n);
    for(int i = 1; i <= n; i++)
    {
        scanf("%s", c[i]+1);
        for(int j =1 ; j <= i; j++)
            if(c[i][j] == ‘*‘)
                f[i] = 1, g[j] = 1, p[Mabs(i-j)] = 1;
    }
    dfs(1, 0);
    printf("%d\n%d\n", ans, t.size());
    /*for(set< vector<int> >::iterator it = t.begin(); it != t.end(); it++)
    {
        vector<int> now = *it;
        for(int i = 0; i < now.size(); i++)
            printf("%d ",now[i]);
        printf("\n");
    }*/
    return 0;
}