codeforce round 247 div.2 B
2014-05-22 16:33
423 查看
#include <iostream> #include <algorithm> using namespace std; int main() { int a[6][6],t[6]; long long r=0; for(int i=1;i<=5;i++) t[i]=i; for(int i=1;i<=5;i++) for(int j=1;j<=5;j++) cin>>a[i][j]; for(int i=2;i<=5;i++) for(int j=1;j<i;j++){ a[i][j]+=a[j][i]; a[j][i]=a[i][j]; } for(int i=1;i<=120;i++){ long long m=a[t[1]][t[2]]+2*a[t[3]][t[4]]+a[t[2]][t[3]]+2*a[t[4]][t[5]]; if(m>r) r=m; next_permutation(t+1,t+6); } cout<<r<<endl; return 0; }
相关文章推荐
- 【打渔】CodeForce Round 197 Div.2 Problem_A
- CodeForce Round #186 Div.2
- codeforce 247 div.2 B
- Codeforces Round #430(Div.2) C,D,E题目详解
- Codeforces Round #434 (Div.2) - C - Did you mean...
- Codeforces AIM Tech Round 3 (Div.2)A.Juicer【模拟】水题
- Codeforces Round 190 div.2 322C 321A Ciel and Robot
- Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) C. Destroying Array
- codeforces round 252 (div.2 ) D
- codeforce round A. Binary Protocol
- Codeforce Round #222 Div2
- codeforces Round 314 div.2 分类: codeforces introspect 2015-08-08 13:52 7人阅读 评论(0) 收藏
- Codeforces Round #278 (Div. 2) B. Candy Boxes [brute force+constructive algorithms]
- Codeforces Round 261 Div.2 E Pashmak and Graph --DAG上的DP
- Codeforces Round #389(Div.2)C Santa Claus and Robot【思维】
- Codeforce Round 363(Div2)A(Java)
- Codeforces Round #386 (Div.2)部分题解
- codeforces Round #Pi (div.2) 567ABCD
- CodeForces Round #294 Div.2
- CodeForces Round #295 Div.2