随笔分类 -  其它 maybe思维题？

10774: matrix
摘要：10774: matrix 题目描述 现在有一个n*m的01矩阵，矩阵的行与行可以互相交换，我们现在想知道在一个最优的交换方案中，其中最大的全1子矩阵能有多大。 输入 第一行两个整数n，m。接下来n行，每行一个长度为m的01字符串，描述这个01矩阵。 输出 一个数，即最大的全1子矩阵面积。 样例输入 阅读全文
posted @ 2019-02-26 15:23 zangzang 阅读(212) 评论(0) 推荐(0)
Find Integer
摘要：Find Integer Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 6597 Accepted Submission(s): 1852Spe 阅读全文
posted @ 2018-08-26 09:55 zangzang 阅读(340) 评论(0) 推荐(0)
CSGO HDU 6435
摘要：参考：https://blog.csdn.net/ffgcc/article/details/81951339 题目描述 参考：https://blog.csdn.net/ffgcc/article/details/81951339 题目描述 You are playing CSGO.There a 阅读全文
posted @ 2018-08-23 16:15 zangzang 阅读(386) 评论(0) 推荐(0)
Minimum Cost Perfect Matching（牛客）
摘要：A、Minimum Cost Perfect Matching | 时间限制：1秒 | 内存限制：256MYou have a complete bipartite graph where each part contains exactly n nodes, numbered from 0 to 阅读全文
posted @ 2018-08-09 20:11 zangzang 阅读(495) 评论(0) 推荐(0)
Chocolate Bar
摘要：问题 L: Chocolate Bar 题目描述 There is a bar of chocolate with a height of H blocks and a width of W blocks. Snuke is dividing this bar into exactly three 阅读全文
posted @ 2018-06-14 22:02 zangzang 阅读(490) 评论(0) 推荐(0)
Lining Up
摘要：问题 H: Lining Up 题目描述 There are N people, conveniently numbered 1 through N. They were standing in a row yesterday, but now they are unsure of the orde 阅读全文
posted @ 2018-06-01 14:40 zangzang 阅读(781) 评论(0) 推荐(0)
Snuke's Coloring 2-1
摘要：问题 H: Snuke's Coloring 2-1 题目描述 There is a rectangle in the xy-plane, with its lower left corner at (0,0) and its upper right corner at (W,H). Each of 阅读全文
posted @ 2018-05-26 19:31 zangzang 阅读(164) 评论(0) 推荐(0)
AtCoDeer and Election Report
摘要：问题 F: AtCoDeer and Election Report 题目描述 AtCoDeer the deer is seeing a quick report of election results on TV. Two candidates are standing for the elec 阅读全文
posted @ 2018-05-26 19:30 zangzang 阅读(205) 评论(0) 推荐(0)
Unhappy Hacking I
摘要：问题 J: Unhappy Hacking I 题目描述 Sig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 k 阅读全文
posted @ 2018-05-18 08:45 zangzang 阅读(211) 评论(0) 推荐(0)
Iroha's Obsession
摘要：问题 D: Iroha's Obsession 题目描述 Iroha is very particular about numbers. There are K digits that she dislikes: D1,D2,…,DK. She is shopping, and now paying 阅读全文
posted @ 2018-05-18 08:41 zangzang 阅读(389) 评论(0) 推荐(0)
Box and Ball
摘要：5582: Box and Ball 题目描述 We have N boxes, numbered 1 through N. At first, box 1 contains one red ball, and each of the other boxes contains one white b 阅读全文
posted @ 2018-05-14 20:30 zangzang 阅读(238) 评论(0) 推荐(0)
问题 J: Frosting on the Cake
摘要：问题 J: Frosting on the Cake 题目描述 Iskander the Baker is decorating a huge cake, covering the rectangular surface of the cake with frosting.For this purp 阅读全文
posted @ 2018-05-01 23:22 zangzang 阅读(437) 评论(0) 推荐(0)