Codeforces Round #247 (Div. 2) B - Shower Line

模拟即可

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
    vector<int> a();
    for(int i = ; i < ; ++ i) a[i] = i;
    int g[][];
    for(int i =  ; i < ; ++ i){
        for(int j =  ; j < ; ++ j){
            cin >> g[i][j];
        }
    }
    int maxHappiness = ;
    do{
        maxHappiness = max(g[a[]][a[]]+g[a[]][a[]]+g[a[]][a[]]+g[a[]][a[]]+g[a[]][a[]]+g[a[]][a[]]+g[a[]][a[]]+g[a[]][a[]]+g[a[]][a[]]+g[a[]][a[]]+g[a[]][a[]]+g[a[]][a[]],maxHappiness);
        cout<<a[]<<a[]<<a[]<<a[]<<a[]<<endl;
        cout<<maxHappiness<<endl;

    }while(next_permutation(a.begin(),a.end()));
    cout<<maxHappiness<<endl;

}