_laekov

[Problem]bzoj3531[S

[Solution]It seems to be a abnormal data structu

[Solution]Digit DP. The hole in this problem is that

[Solution]What's that? I tried to use dp[l][r][p] to solve this. However, it cannot even pass the sample.

[]What a problem! I thought I had to spend more than a week to solve it. Fortunately, it didn't cost me so long

[]因为换上

[Solution]Simply modify some important positions by

[Solution]I certainly do not use vEB tree, because I don't know how to solve it at all.I certainly do not use vEB tree, because I don't know how to solve it at all. I used segtree.[Code]#inclu

[Solution]This is a classic DP which I didn't know until now. Consider the

[]It must be true that today isn't suitable for coding.[Solution]

[Solution]It is likely that you need to modify the dfs order by a dynamic data structure. However, n is not big enough to use log-level algorithm. Divide the tree into sqrt(n) parts. Then use treaps

[Solution]

[Problem][Solution]L

[Problem]最近，阿Q开了一间宠物收养所。收养所提供两种服务：收养被主人遗弃的宠物和让新的主人领养这些宠物。每个领养者都希望领养到自己满意的宠物，阿Q根据领养者的要求通过他自己发明的一个特殊的公式，得出该领养者希望领养的宠物的特点值a（a是一个正整数，a<2^31），而他也给每个处在收养所的宠物一个特点值。这样他就能够很方便的处理整个领养宠物的过程了，宠物收养所总是会有两种情况发生：被遗

[Solution]The original equation equals tosigma(n % i) * sigma(m % j) - sigma(

[Solution]It's easy to thi

[]My 200th solved problem on BZOJ. So slow am I brus[Solution]It seems like a network flow

[Solution]This is a classic problem of link cut tree

[Problem]给出正整数n和k，计算j(n, k)=k mod 1 + k mod 2 + k mod 3 + … + k mod n的值，其中k mod i表示k除以i的余数。例如j(5, 3)=3 mod 1 + 3 mod 2 + 3 mod 3 + 3 mod 4 + 3 mod 5=0+1+0+3+3=7[Solution]It's now not eas

[Solution]I got WA at the exams, because so

[Solution]It

[Solution]W

[Solution]I thought of size-balanced tree at first, the got only 60 at the ex

[Problem] BZOJ3156[

[Solution]Binary find the