摘要： " 题目链接 " Problem Description In the mathematical discipline of graph theory, a bipartite graph is a graph whose vertices can be divided into two disjo 阅读全文

摘要： " 题目链接 " Problem Description Have you ever seen the wave? It's a wonderful view of nature. Little Q is attracted to such wonderful thing, he even like 阅读全文

摘要： " 题目链接 " Problem Description In mathematics, the function d(n) denotes the number of divisors of positive integer n. For example, d(12)=6 because 1,2, 阅读全文

摘要： " 题目链接 " Problem Description In ACM/ICPC contest, the ''Dirt Ratio'' of a team is calculated in the following way. First let's ignore all the problems 阅读全文

摘要： " 题目链接 " Problem Description 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+ 阅读全文

摘要： " 题目链接 " Problem Description RXD is a good mathematician. One day he wants to calculate: ∑i=1nkμ2(i)×⌊nki−−−√⌋ output the answer module 109+7. 1≤n,k≤1 阅读全文

摘要： " 题目链接 " Problem Description 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 th 阅读全文

摘要： 问题描述：指派问题 有N台计算机和K个任务。我们可以给每台计算机分配一个任务，每台计算机可以处理的任务种类各不相同。请求出最多能处理的任务的个数。 分析： 这个问题可以转换为图论问题来分析。我们可以定义无向二分图G=(U∪V，E)。 U是代表计算机的顶点集合，V是代表任务的顶点集合，对于任意u∈U和 阅读全文

摘要： " 题目链接 " Problem Description Dear Liao I never forget the moment I met with you. You carefully asked me: "I have a very difficult problem. Can you tea 阅读全文

摘要： 话题引入：最大传输量 网络中有两台计算机s和t，现在想从s传输数据到t。该网络中一共有N台计算机，其中一些计算机之间连有一条单向的通信电缆，每条通信电缆都有对应的1秒钟内所能传输的最大数据量。当其他计算机之间没有数据传输时，在1秒内s最多可以传输多少数据到t？ 分析： 把计算机当作顶点，把连接计算机 阅读全文