cf-Food Allocation I

Food Allocation I

---

思路

此题数据范围较少，可以用dfs+回溯过
递归到第n层，记录此时的sum
子母题Food Allocation II

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAX_N=11;
int n,a[MAX_N][MAX_N],vis[MAX_N][MAX_N];
ll sum=0,temp=0;
void dfs(int i){
    if(i==n+1){temp=max(temp,sum);return;}
    for(int j=1;j<=n;j++){
        if(vis[i][j]==0){
            for(int k=1;k<=n;k++)//标记这一列，更深层dfs跳过这列
                vis[k][j]=1;
            sum+=a[i][j];
            dfs(i+1);
            sum-=a[i][j];
            for(int k=1;k<=n;k++)
                vis[k][j]=0;
        }
    }
    
}
int main(){
    std::ios::sync_with_stdio(false);
    cin>>n;
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
        cin>>a[i][j];
    dfs(1);
    cout<<temp<<endl;
    return 0;
}