码代码的猿猿

2013年9月25日

摘要：数位DP。。。。F(x)Time Limit: 1000/500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 750 Accepted Submission(s): 286Problem DescriptionFor a decimal number x with n di... 阅读全文

posted @ 2013-09-25 06:52 码代码的猿猿阅读(172) 评论(0) 推荐(0)

UESTC 1852 Traveling Cellsperson

摘要：找规律水题。。。Traveling CellspersonTime Limit: 1000msMemory Limit: 65535KBThis problem will be judged on UESTC. Original ID: 185264-bit integer IO format: %lld Java class name: MainPrev Submit Status S... 阅读全文

posted @ 2013-09-25 05:15 码代码的猿猿阅读(259) 评论(0) 推荐(0)

UESTC 1851 Kings on a Chessboard

摘要：状压DP。。。Kings on a ChessboardTime Limit: 10000msMemory Limit: 65535KBThis problem will be judged on UESTC. Original ID: 185164-bit integer IO format: %lld Java class name: MainPrev Submit Status S... 阅读全文

posted @ 2013-09-25 02:55 码代码的猿猿阅读(235) 评论(0) 推荐(0)

2013年9月24日

POJ 2411 Mondriaan's Dream

摘要：状压DPMondriaan's DreamTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 9938Accepted: 5750DescriptionSquares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after p... 阅读全文

posted @ 2013-09-24 06:02 码代码的猿猿阅读(104) 评论(0) 推荐(0)

POJ 3254 Corn Fields

摘要：基本的状压DP。。。Corn FieldsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 5554Accepted: 2944DescriptionFarmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ ... 阅读全文

posted @ 2013-09-24 00:19 码代码的猿猿阅读(177) 评论(0) 推荐(0)

2013年9月23日

HDOJ 2444 The Accomodation of Students

摘要：染色判读二分图+Hungary匹配The Accomodation of StudentsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1705 Accepted Submission(s): 821Problem Descrip... 阅读全文

posted @ 2013-09-23 00:18 码代码的猿猿阅读(253) 评论(0) 推荐(0)

2013年9月22日

HDOJ 4751 Divide Groups

摘要：染色判断二分图+补图比赛的时候题意居然是反的，看了半天样例都看不懂。。。。Divide GroupsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 456 Accepted Submission(s): 172Problem Des... 阅读全文

posted @ 2013-09-22 22:11 码代码的猿猿阅读(162) 评论(0) 推荐(0)

HDOJ 4750 Count The Pairs

摘要：按边长从小到大排序。。。再逐个加入（就像MST一样）最先联通的点之间最长路径中的最小值就是新加入的边的长。。。。Count The PairsTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 266 Accepted Submiss... 阅读全文

posted @ 2013-09-22 19:39 码代码的猿猿阅读(190) 评论(0) 推荐(0)

HDOJ 1711 Number Sequence

摘要： Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8600 Accepted Submission(s): 3953Problem DescriptionGiven two sequences of nu... 阅读全文

posted @ 2013-09-22 07:40 码代码的猿猿阅读(133) 评论(0) 推荐(0)

POJ 2299 Ultra-QuickSort

摘要：离散化+树状数组求逆序数Ultra-QuickSortTime Limit: 7000MSMemory Limit: 65536KTotal Submissions: 35024Accepted: 12608DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm pr... 阅读全文

posted @ 2013-09-22 04:37 码代码的猿猿阅读(134) 评论(0) 推荐(0)

码代码的猿猿

公告