网络流
没有说明简介的了
lonely_wind_
路漫漫兮
展开
-
CSUST 2001-没用的FFT(网络流+素数密度猜想)
题目链接:http://acm.csust.edu.cn/problem/2001 博客园食用链接:https://www.cnblogs.com/lonely-wind-/p/13394050.html Description FFT是一种用来求卷积的算法,能够在 nlog(n)nlog(n)nlog(n)的复杂度算出 F(x)=g(x)∗f(x)F(x)=g(x)*f(x)F(x)=g(x)∗f(x)的系数。 众所周知他是没有用的,今天我就要为他证明,他是有用的.给你个最高次项为n的多项式.请求出A和B原创 2020-07-28 21:44:45 · 355 阅读 · 0 评论 -
2020杭电HDU多校第二场New Equipments(三分+费用流)
Problem Description Little Q’s factory recently purchased m pieces of new equipment, labeled by 1,2,…,m. There are n workers in the factory, labeled by 1,2,…,n. Each worker can be assigned to no more than one piece of equipment, and no piece of equipment c原创 2020-07-23 19:21:21 · 797 阅读 · 0 评论