dfs解决数塔问题；

#include <iostream>#include <stdio.h> #include <vector>  using namespace std; const int maxn=200; int tower[maxn][maxn]; vector<int> temp,ans; int n; int maxsum=-1; void dfs(int x,int y,int count){ if

>>阅读原文<<