原创 uva 11404
#include<iostream> #include<cstdio> #include<cstring> using namespace std; char s1[1010],s2[2010]; int maxs,temp; st
2018-08-25 08:40:37
原创 HDU4870 Rating(概率)
第一場多校，感覺自己都跳去看坑自己的題目裏去了，很多自己可能會比較擅長一點的題目沒看，然後寫一下其中一道概率題的題解吧，感覺和自己前幾天做的概率dp的思路是一樣的。下面先來看題意：一個人有兩個TC的賬號，一開始兩個賬號rating都
2018-08-25 08:40:37
原创 hdu 1072 Nightmare(DFS)
Nightmare Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 659
2018-08-25 08:40:37
原创 hdu 1176
免費餡餅 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 19551
2018-08-25 08:40:36
1
原创 UVA113 - Power of Cryptography
Power of Cryptography Background Current work in cryptography involves (among other things) large prime num
2018-08-25 08:40:36
原创 HDU 4489The King’s Ups and Downs(dp遞推)
Description The king has guards of all different heights. Rather than line them up in increasing or decreasing hei
2018-08-25 08:40:36
原创 多校第一場Couple doubi
Couple doubi Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s):
2018-08-25 08:40:36
1
原创 hdu 1421(搬寢室)
搬寢室 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 129
2018-08-25 08:40:34
原创 hdu4488 Faulhaber’s Triangle
Description The sum of the mth powers of the first n integers S(n,m) = SUM ( j= 1 to n)( jm) Can be written a
2018-08-25 08:40:34
原创 單調隊列之求最大和
hdu 3415 Max Sum of Max-K-sub-sequence Max Sum of Max-K-sub-sequence Time Limit: 2000/1000 MS (Java/Others) Memo
2018-08-25 08:40:34
原创 hdu 4399
Description You are given two strings s1[0..l1], s2[0..l2] and Q - number of queries. Your task is to answer next
2018-08-25 08:40:32
2