原创 poj2411Mondriaan's Dream
Mondriaan's Dream Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 11810 Accepted: 6866 Description S
原创 poj 3107 Godfather
題目大意就是讓你找,刪除一個點,使得剩下的子樹中,節點數最多的最小。其實此題就是求重心。 我們來回顧一下樹的重心的性質: 1.刪除重心後,剩下的子樹中點個數最大的最小,並且小於n/2。 2.樹中所有點到某個點的距離和中,到重心的距離和是
原创 Codeforces Beta Round #4 (Div. 2 Only)D. Mysterious Present
D. Mysterious Present time limit per test 2 seconds memory limit per test 64 megabytes input standard inpu
原创 Codeforces Round #202 (Div. 2)B. Color the Fence
B. Color the Fence time limit per test 2 seconds memory limit per test 256 megabytes input standard input
原创 Codeforces Round #139 (Div. 2)C. Barcode
C. Barcode time limit per test 2 seconds memory limit per test 256 megabytes input standard input output stan
原创 Codeforces Beta Round #2B. The least round way
B. The least round way time limit per test 5 seconds memory limit per test 64 megabytes input standard inp
原创 hdu4804Campus Design
Campus Design Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s)
原创 Codeforces Round #112 (Div. 2) C. Another Problem on Strings
C. Another Problem on Strings time limit per test 2 seconds memory limit per test 256 megabytes input standard
原创 Codeforces Round #135 (Div. 2)VD. Choosing Capital for Treeland
D. Choosing Capital for Treeland time limit per test 3 seconds memory limit per test 256 megabytes input s
原创 hdu 5067 Harry And Dig Machine
As we all know, Harry Porter learns magic at Hogwarts School. However, learning magical knowledge alone is insufficie
原创 cf div2(262)c題
C. Present time limit per test 2 seconds memory limit per test 256 megabytes input standard input output
原创 Codeforces Beta Round #89 (Div. 2)D. Caesar's Legions
D. Caesar's Legions time limit per test 2 seconds memory limit per test 256 megabytes input standard input ou
原创 Codeforces Round #135 (Div. 2)C. Color Stripe
C. Color Stripe time limit per test 2 seconds memory limit per test 256 megabytes input standard input
原创 zoj3201Tree of Tree
Tree of Tree Time Limit: 1 Second Memory Limit: 32768 KB You're given a tree with weights of each node, you need
原创 git 小積累
1.命令忽略修改過的文件 git update-index --assume-unchanged + 文件 取消忽略 git update-index --no-assume-unchanged <files>