http://codeforces.com/problemset/problem/431/B
5!=120 暴力
#include <iostream>
#include <algorithm>
using namespace std;
int a[6][6];
int b[6]={0,1,2,3,4,5};
int main()
{while(cin>>a[1][1])
{
for(int i=2;i<=5;i++)
cin>>a[1][i];
for(int i=2;i<=5;i++)
for(int j=1;j<=5;j++)
cin>>a[i][j];
int max=-1;
int sum;
do
{
sum=a[b[1]][b[2]]+a[b[2]][b[1]]+a[b[3]][b[4]]+a[b[4]][b[3]];
sum+=a[b[2]][b[3]]+a[b[3]][b[2]]+a[b[4]][b[5]]+a[b[5]][b[4]];
sum+=a[b[3]][b[4]]+a[b[4]][b[3]];
sum+=a[b[4]][b[5]]+a[b[5]][b[4]];
if(sum>max)
max=sum;
}
while(next_permutation(b+1,b+6));
cout<<max<<endl;
}
return 0;
}