B. Find the Spruce：题目

题意：找有多少树状结构。
思路：递推，从下往上算树尖。

#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int> a((int)6e5);
vector<int> b((int)6e5), c((int)6e5);
const int mod = 1e9 + 7;
char ch[555][555];
int sum[555][555];
int n, m;
signed main()
{int t;cin >> t;while (t--){memset(sum,0,sizeof sum);cin >> n >> m;for (int i = 1; i <= n; i++)for (int j = 1; j <= m; j++)cin >> ch[i][j];int res = 0;for (int i = n; i >= 1; i--){for (int j = 1; j <= m; j++){if (ch[i][j] == '*'){sum[i][j] = 1;sum[i][j] = max(sum[i][j], min(min(sum[i + 1][j - 1], sum[i + 1][j + 1]), sum[i + 1][j]) + 1);res+=sum[i][j];}}}cout<<res<<endl;}
}