0w1

BZOJ

BZOJ 1036 树的统计 ( 樹平方分割 )

Problem 1036. -- [ZJOI2008]树的统计Count このテクすごいね、猛練習しよう。 #include <bits/stdc++.h> using namespace std; const int MAXN = 3e4 + 4; const int MAXQ = 2e5 + 5; const int INF = 0x3f3f3f3f; int n; vector< int > es[ MAXN ], bes[ MAXN ]; int par[</bits/stdc++.h>…

BZOJ 1833 数字计数 ( 桁DP )

Problem 1833. -- [ZJOI2010]count 数字计数 Given a ≤ 1e12, b ≤ 1e12, find frequency for each digit in range [ a , b ]. dp[ i ][ j ][ k ]: chose i digits, less flag, not zero Note that when transferring, we are to add the number of ways of i…