| | | | |

2017年3月21日

摘要： 2012 If this is the end of the world how to do? I do not know how. But now scientists have found that some stars, who can live, but some people do not 阅读全文

posted @ 2017-03-21 01:54 奚政阅读(439) 评论(0) 推荐(0)

hdu3488 Tour 拆点+二分图最佳匹配

摘要： In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You are lucky enough to have a chance 阅读全文

posted @ 2017-03-21 01:43 奚政阅读(240) 评论(0) 推荐(0)

hdu3374 String Problem KMP+最大最小表示法

摘要： Give you a string with length N, you can generate N strings by left shifts. For example let consider the string “SKYLONG”, we can generate seven strin 阅读全文

posted @ 2017-03-21 01:40 奚政阅读(195) 评论(0) 推荐(0)

hdu3338 Kakuro Extension 最大流

摘要： If you solved problem like this, forget it.Because you need to use a completely different algorithm to solve the following one.Kakuro puzzle is played 阅读全文

posted @ 2017-03-21 01:31 奚政阅读(266) 评论(0) 推荐(0)

hdu3336 Count the string 扩展KMP

摘要： It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-emp 阅读全文

posted @ 2017-03-21 01:27 奚政阅读(220) 评论(0) 推荐(0)

hdu3294 Girls' research manacher

摘要： One day, sailormoon girls are so delighted that they intend to research about palindromic strings. Operation contains two steps:First step: girls will 阅读全文

posted @ 2017-03-21 01:23 奚政阅读(169) 评论(0) 推荐(0)

hdu3068 最长回文 manacher

摘要：给出一个只由小写英文字符a,b,c...y,z组成的字符串S,求S中最长回文串的长度.回文就是正反读都是一样的字符串,如aba, abba等 manacher裸题 1 #include<stdio.h> 2 #include<string.h> 3 #include<algorithm> 4 usi 阅读全文

posted @ 2017-03-21 01:19 奚政阅读(106) 评论(0) 推荐(0)

hdu2886 Lou 1 Zhuang 数学/快速幂

摘要： All members of Hulafly love playing the famous network game called 'Lou 1 Zhuang' so much that Super Da Lord got mad with them. So he thought over and 阅读全文

posted @ 2017-03-21 01:16 奚政阅读(229) 评论(0) 推荐(0)

hdu2841 Visible Trees 容斥原理

摘要： There are many trees forming a m * n grid, the grid starts from (1,1). Farmer Sherlock is standing at (0,0) point. He wonders how many trees he can se 阅读全文

posted @ 2017-03-21 01:05 奚政阅读(160) 评论(0) 推荐(0)

hdu2819 Swap 二分图匹配

摘要： Given an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make all the diagonal entries 阅读全文

posted @ 2017-03-21 01:03 奚政阅读(297) 评论(0) 推荐(0)

2017年3月21日

公告