ZOJ 2418Matrix
来源:互联网 发布:淘宝在哪里看未认证 编辑:程序博客网 时间:2024/06/03 15:58
Given an n*n matrix A, whose entries Ai,j are integer numbers ( 0 <= i < n, 0 <= j < n ). An operation SHIFT at row i ( 0 <= i < n ) will move the integers in the row one position right, and the rightmost integer will wrap around to the leftmost column.
You can do the SHIFT operation at arbitrary row, and as many times as you like. Your task is to minimize
The input consists of several test cases. The first line of each test case contains an integer n. Each of the following n lines contains n integers, indicating the matrix A. The input is terminated by a single line with an integer -1. You may assume that 1 <= n <= 7 and |Ai,j| < 104.
For each test case, print a line containing the minimum value of the maximum of column sums.
2
4 6
3 7
3
1 2 3
4 5 6
7 8 9
-1
11
15
直接爆搜就可以过。
#include<iostream>#include<cstdio>#include<cstring>#include<queue>#include<cmath>#include<map>#include<algorithm>using namespace std;typedef long long LL;#define rep(i,j,k) for (int i=j;i<=k;i++)#define per(i,j,k) for (int i=j;i>=k;i--)#define inone(x) scanf("%d",&x)#define intwo(x,y) scanf("%d%d",&x,&y)typedef pair<int,int> pii;const int N = 15;const int INF=0x7FFFFFFF;int n,a[N][N],b[N],ans;int calc(){ int res=-INF; rep(i,0,n-1) { int cnt=0; rep(j,0,n-1) { cnt+=a[j][(i+b[j])%n]; } res=max(res,cnt); } return res;}void dfs(int x){ if (x==n) { ans=min(ans,calc()); return; } rep(i,0,n-1) { b[x]=i; dfs(x+1); }}int main(){ while (~inone(n)&&n!=-1) { rep(i,0,n-1) rep(j,0,n-1) inone(a[i][j]); ans=INF; b[0]=0; dfs(1); printf("%d\n",ans); } return 0;}
- ZOJ 2418Matrix
- zoj 2418 || poj 2078 Matrix
- zoj 2859 Matrix Searching
- zoj Matrix Searching
- zoj 3578 matrix
- zoj 3578 Matrix
- zoj 2859 Matrix Searching
- zoj 2859 Matrix Searching
- ZOJ 2859 Matrix Searching
- zoj 2859 Matrix Searching
- ZOJ 2316 Matrix Multiplication
- Matrix Multiplication(zoj 2316)
- zoj 2316 Matrix Multiplication
- Matrix Processing ZOJ
- zoj - 1094 - Matrix Chain Multiplication
- ZOJ 1636 Evaluate Matrix Sum
- zoj-1094-Matrix Chain Multiplication
- zoj 1094 Matrix Chain Multiplication
- java编译时与运行时概念明晰
- HTTP状态码
- 3D XPoint工作原理
- 不正经运维狗的文档1—15
- SparkSQL之创建DataFrame
- ZOJ 2418Matrix
- Debain 8.7
- 数组和簇(正弦余弦)
- CS 231A CV(winter 2014) problem set 3第一题第三小题(给定关键点及边框寻找最优边框)
- [ERP]VMI概念与运用场景
- CentOS7下vsftpd虚拟用户配置
- iOS
- maven增量编译的思考(转载)
- 巧用python和libnmapd,一行代码提取Nmap扫描结果