TopCoder
文章平均质量分 80
maverick1990
这个作者很懒,什么都没留下…
展开
-
TopCoder SRM 590 Div2 第3题
题目大意:一张图有多列,每列有'U','D','.'的排列。U表示可向上走,D表示可向下走,.表示为空,U和P不能交叉或重合,问有几种摆法例如:".D.""..."".U."有三种摆法,分别为:".D.""..."".U." "..."".D."".U." ".D."".U.""..." 分析:整体思路是,算出每一列的摆法,然原创 2013-09-12 11:15:48 · 1444 阅读 · 0 评论 -
TopCoder SRM 602 Div1 第1题
Problem Statement TypoCoder is a programming contest like TopCoder. TypoCoder also has a rating system. There are two types of coders in TypoCoder: brown coders and ciel coders. A bro原创 2013-12-30 20:48:10 · 1244 阅读 · 0 评论 -
TopCoder SRM 598 Div1 第2题
Problem Statement Fox Ciel is playing a board game with her friend Squirrel Liss. The game is played on an infinite strip of paper. The strip of paper is divided into consecutive cell原创 2013-12-02 21:15:29 · 997 阅读 · 0 评论 -
TopCoder SRM 598 Div1 第1题
Problem Statement Fox Ciel has some items. The weight of the i-th (0-based) item is item[i]. She wants to put all items into bins.The capacity of each bin is 300. She can put an a原创 2013-12-02 20:20:27 · 1001 阅读 · 0 评论 -
TopCoder SRM 597 Div1 第3题
Problem Statement Little Elephant from the Zoo of Lviv has a board with 2 rows and M columns. Each cell of the board must be painted in one of three colors: red, green, or blue.原创 2013-11-26 19:17:03 · 1466 阅读 · 0 评论 -
TopCoder SRM 595 Div2 第3题
类型:数论 难度:2.5题意:给出三个数A,B,C,求(X,Y)的数目,(X,Y)满足 0 A, 0 B,且(X异或Y)分析:最近碰到很多计数题,这题花了不少时间,方法有点麻烦。。先将A,B,C转换为二进制存入数组,dp[pos][ia][ib][ic]表示第pos位A,B,C是否置定,ia,ib,ic为0,1,0表示未置定,1表示置定。ia置定即该位A可任取0,1,置定的原原创 2013-11-12 20:45:33 · 930 阅读 · 0 评论 -
TopCoder SRM 597 Div1 第1题
Problem Statement Little Elephant from the Zoo of Lviv likes strings. You are given a string A and a string B of the same length. In one turn Little Elephant can choose any charac原创 2013-11-25 23:33:34 · 1047 阅读 · 0 评论 -
TopCoder SRM 596 Div2 第3题
Problem Statement For an integer n, let F(n) = (n - 0^2) * (n - 1^2) * (n - 2^2) * (n - 3^2) * ... * (n - k^2), where k is the largest integer such that n - k^2 > 0. You are given thr原创 2013-11-18 12:48:23 · 1075 阅读 · 0 评论 -
TopCoder SRM 589 Div2 第3题
类型:dp 难度:2.5题意:给定一个字符串数组,每个字符串都由0或1构成,先把他们连起来成一个大字符串,给定整数M,M能被字符串总长度n整除,然后指定可以进行的三种操作:1、翻转一个字符,0->1或1->02、翻转左边k*M个字符,k为任意正整数(k*M3、翻转右边k*M个字符,k为任意正整数(k*M问:最少需要进行几次操作,才能将全部字符串全置为1 分析:一开始绕原创 2013-09-18 10:12:57 · 1454 阅读 · 0 评论 -
TopCoder SRM 589 Div2 第2题
类型:DP 难度:2题意:一堆齿轮两两相邻排成一圈,给出每个齿轮旋转方向,齿轮首尾相连,即n个齿轮,0和n-1相邻,齿轮与左右相邻的齿轮方向都相反才能转动,去掉一个齿轮,左右齿轮不看成相邻,问至少去掉几个齿轮,才能保证剩余齿轮都能按照给定方向转动。齿轮方向用L,R表示。 分析:dp问题,用dp[i][0]存储去掉第i个齿轮,0到i总共去掉的齿轮数最小值,dp[i][1]表示不去掉第i原创 2013-09-13 15:36:20 · 1039 阅读 · 0 评论 -
TopCoder SRM 140 Div2 第3题
类型:图论 难度:2题意:发电站和各级变压器构成一棵树的节点,发电站为根节点。现在需要从根节点出发,沿树边检查每个节点,必要时回溯,检查完最后一个节点立即终止,给出每条边的耗时/路径长,求最短耗时/最短路径。分析:由于要遍历所有节点,所有假设根节点有n个子树,只有走最后一棵子树时不用回溯到根节点。其余n-1棵子树均需回到根节点,则其余n-1棵子树所走的路径长即为:(每棵子树的路径和原创 2013-09-12 14:46:35 · 1110 阅读 · 0 评论 -
TopCoder SRM 604 Div1 第1题
Problem Statement Fox Ciel has a robot. The robot is located on an infinite plane. At the beginning, the robot starts at the coordinates (0, 0). The robot can then make several steps. The s原创 2014-01-12 23:21:10 · 1338 阅读 · 0 评论