摘要：
During the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. General... 阅读全文
摘要：
Time limit3000 msMemory limit32768 kBThere are a bunch of stones on the beach; Stone color is white or black. Little Sheep has a magic... 阅读全文
摘要：
方法一：int tmp = 0; tmp = b; b = a; a = tmp; 方法二：a = a+b;b = a-b;a = a-b;方法三：a ^= b ^= a^= b;方法四：a = a+b-(b=a); 阅读全文
摘要：
Time limit5000 msCase time limit2000 msMemory limit65536 kBFor the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up... 阅读全文
摘要：
In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several cons... 阅读全文
摘要：
Time limit5000 msCase time limit2000 msMemory limit131072 kBYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of ... 阅读全文
摘要：
Time limit1000 msMemory limit100000 kBCorrupt governors always find ways to get dirty money. Paint something, then sell the worthless ... 阅读全文
摘要：
首先是建树：const int MAXN = 1005;//定义 MAXM 为线段最大长度int Tree[4*MAXN];// Data数组为 main 函数中读入的内容，Tree数组为需要查询的数的信息（如和、最值等），树的空间大小为线段最大长度的四倍！四倍！四倍... 阅读全文
摘要：
You are given a string s consisting of lowercase Latin letters. Character c is called k-dominant iff each substring of s with length a... 阅读全文
摘要：
Time limit2000 msMemory limit262144 kBHarry came to know from Dumbledore that Salazar Slytherin's locket is a horcrux. This locket was... 阅读全文