商业展厅手绘设计图_郑州妇科医院正规有哪些_网站安全检测在线_北京网站seo公司

#include<iostream>
#define menbn 20
#define ray 5
using namespace std;
int team[menbn][ray + 1];
bool vis[20];
int max_sum = 0;
int max(int a,int b) {return a > b ? a : b;
}
void dfs(int u,int sum) {if (u>5) {max_sum = max(max_sum,sum);return;}for (int i = 0; i < 20;i++) {if (!vis[i]) {vis[i] = true;dfs(u+1,sum+team[i][u]);vis[i] = false;}}
}
int main() {for (int i = 0; i < 20;i++) {for (int j = 0; j < 6;j++) {cin >> team[i][j];}}dfs(1,0);cout << max_sum;return 0;
}