2017年08月_oranges_c

原创【HDU6053】TrickGCD(莫比乌斯容斥)

You are given an array A , and Zhu wants to know there are how many different array B satisfy the following conditions?

2017-08-27 17:03:48 378

原创【HDU6040】Hints of sd0061(nth_element)

sd0061, the legend of Beihang University ACM-ICPC Team, retired last year leaving a group of noobs. Noobs have no idea how to deal with m coming contests. sd0061 has left a set of hints for them.There are n n

2017-08-25 13:40:56 310

原创【HDU6038】Function(循环节+计数)

2017 Multi-University Training Contest - Team 1You are given a permutation a from 0 to n−1 and a permutation b from 0 to m−1.Define that the domain of function f is the set of integers from 0 to n−1, and the

2017-08-25 13:16:17 262

原创【HDU6035】Colorful Tree(dfs,树形dp)

There is a tree with n nodes, each of which has a type of color represented by an integer, where the color of node i is ci.The path between each two different nodes is unique, of which we define the value as

2017-08-25 12:45:32 270

原创【HDU6153】A Secret(扩展KMP)

Today is the birthday of SF,so VS gives two strings S1,S2 to SF as a present,which have a big secret.SF is interested in this secret and ask VS how to get it.There are the things that VS tell: Suffix(S2,i) =

2017-08-21 14:42:17 238

原创【HDU6034】Balala Power!

Talented Mr.Tang has n strings consisting of only lower case characters. He wants to charge them with Balala Power (he could change each character ranged from a to z into each number ranged from 0 to 25, but ea

2017-08-20 16:44:17 258

原创【HDU6134】Battlestation Operational(莫比乌斯反演)

2017 Multi-University Training Contest - Team 8题目链接题目大意: 让你求f(n)=∑i=1n∑j=1n⌈ij⌉[(i,j)=1]f(n) = \sum_{i = 1}^{n} \sum_{j = 1}^{n} \lceil \frac{i}{j} \rceil [(i, j) = 1]理解了q巨的解法后，对反演理解了点。。以下

2017-08-18 13:43:10 587

原创【HDU6058】Kanade's sum(暴力 or 链表)

Give you an array A[1..n]of length n. Let f(l,r,k) be the k-th largest element of A[l..r].Specially , f(l,r,k)=0 if r−l+1<k.Give you k , you need to calculate ∑nl=1∑nr=lf(l,r,k)There are T test cases.

2017-08-02 15:03:02 330

原创【HDU6060】RXD and dividing(dfs)

RXD has a tree T, with the size of n. Each edge has a cost.Define f(S) as the the cost of the minimal Steiner Tree of the set S on tree T. he wants to divide 2,3,4,5,6,…n into k parts S1,S2,S3,…Sk,where

2017-08-02 14:44:29 397

No Program No Life