2018 年 5月 14 日随笔档案 - Assassin_poi君

摘要： Time limit1000 msMemory limit100000 kBCorrupt governors always find ways to get dirty money. Paint something, then sell the worthless ... 阅读全文

posted @ 2018-05-14 21:03 Assassin_poi君阅读(115) 评论(0) 推荐(0)

摘要：首先是建树：const int MAXN = 1005;//定义 MAXM 为线段最大长度int Tree[4*MAXN];// Data数组为 main 函数中读入的内容，Tree数组为需要查询的数的信息（如和、最值等），树的空间大小为线段最大长度的四倍！四倍！四倍... 阅读全文

posted @ 2018-05-14 19:33 Assassin_poi君阅读(133) 评论(0) 推荐(0)

摘要： 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... 阅读全文

posted @ 2018-05-14 16:40 Assassin_poi君阅读(166) 评论(0) 推荐(0)

摘要： Time limit2000 msMemory limit262144 kBHarry came to know from Dumbledore that Salazar Slytherin's locket is a horcrux. This locket was... 阅读全文

posted @ 2018-05-14 16:04 Assassin_poi君阅读(221) 评论(0) 推荐(0)

摘要： Time limit1000 msMemory limit65536 kBFor a number,if the length of continuous odd digits is even and the length of continuous even dig... 阅读全文

posted @ 2018-05-14 14:24 Assassin_poi君阅读(185) 评论(0) 推荐(0)

Assassin_poi君