大桃桃 - 博客园

L2-018 多项式A除以B(模拟)

摘要：这仍然是一道关于A/B的题，只不过A和B都换成了多项式。你需要计算两个多项式相除的商Q和余R，其中R的阶数必须小于B的阶数。输入格式：输入分两行，每行给出一个非零多项式，先给出A，再给出B。每行的格式如下： N e[1] c[1] ... e[N] c[N] 其中N是该多项式非零项的个数，e[i 阅读全文

posted @ 2019-01-17 21:19 大桃桃阅读(326) 评论(0) 推荐(0)

L3-021 神坛(极角排序求三角形最小面积)

摘要：在古老的迈瑞城，巍然屹立着 n 块神石。长老们商议，选取 3 块神石围成一个神坛。因为神坛的能量强度与它的面积成反比，因此神坛的面积越小越好。特殊地，如果有两块神石坐标相同，或者三块神石共线，神坛的面积为 0.000。长老们发现这个问题没有那么简单，于是委托你编程解决这个难题。输入格式：输入在阅读全文

posted @ 2019-01-17 01:08 大桃桃阅读(1652) 评论(3) 推荐(1)

TZOJ 5101 A Game(区间DP)

摘要：描述 Consider the following two-player game played with a sequence of N positive integers (2 <= N <= 100) laid onto a 1 x N game board. Player 1 starts 阅读全文

posted @ 2019-01-15 00:11 大桃桃阅读(198) 评论(0) 推荐(0)

TZOJ 4244 Sum(单调栈区间极差)

摘要：描述 Given a sequence, we define the seqence's value equals the difference between the largest element and the smallest element in the sequence. As an e 阅读全文

posted @ 2018-12-30 16:36 大桃桃阅读(563) 评论(0) 推荐(0)

TZOJ 3820 Revenge of Fibonacci(大数+trie)

摘要：描述 The well-known Fibonacci sequence is defined as following: Here we regard n as the index of the Fibonacci number F(n).This sequence has been studie 阅读全文

posted @ 2018-12-05 18:38 大桃桃阅读(196) 评论(0) 推荐(0)

HDU 4780 Candy Factory(拆点费用流)

摘要： Problem Description A new candy factory opens in pku-town. The factory import M machines to produce high quality candies. These machines are numbered 阅读全文

posted @ 2018-11-19 22:00 大桃桃阅读(258) 评论(0) 推荐(0)

HDU 5977 Garden of Eden(点分治求点对路径颜色数为K)

摘要： Problem Description When God made the first man, he put him on a beautiful garden, the Garden of Eden. Here Adam lived with all animals. God gave Adam 阅读全文

posted @ 2018-11-10 15:53 大桃桃阅读(245) 评论(0) 推荐(0)

HDU 5828 Rikka with Sequence(线段树区间加开根求和)

摘要： Problem DescriptionAs we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is o 阅读全文

posted @ 2018-10-24 11:05 大桃桃阅读(211) 评论(0) 推荐(0)

TZOJ 1689 Building A New Barn(求平面上有几个其它点求到n个点的曼哈顿距离最小)

摘要：描述 After scrimping and saving for years, Farmer John has decided to build a new barn. He wants the barn to be highly accessible, and he knows the coor 阅读全文

posted @ 2018-10-24 10:38 大桃桃阅读(730) 评论(0) 推荐(0)

HDU 5734 Acperience(数学推导)

摘要： Problem Description Deep neural networks (DNN) have shown significant improvements in several application domains including computer vision and speech 阅读全文

posted @ 2018-10-21 11:01 大桃桃阅读(153) 评论(0) 推荐(0)

POJ 1741 Tree(点分治点对<=k)

摘要： Description Give a tree with n vertices,each edge has a length(positive integer less than 1001). Define dist(u,v)=The min distance between node u and 阅读全文

posted @ 2018-10-19 21:40 大桃桃阅读(202) 评论(0) 推荐(0)

HDU 5723 Abandoned country(kruskal+dp树上任意两点距离和)

摘要： Problem DescriptionAn abandoned country has n(n≤100000) villages which are numbered from 1 to n. Since abandoned for a long time, the roads need to be 阅读全文

posted @ 2018-10-18 10:27 大桃桃阅读(157) 评论(0) 推荐(0)

HDU 5988 Coding Contest(最小费用最大流变形)

摘要： Problem DescriptionA coding contest will be held in this university, in a huge playground. The whole playground would be divided into N blocks, and th 阅读全文

posted @ 2018-10-10 14:17 大桃桃阅读(144) 评论(0) 推荐(0)

TZOJ 1693 Silver Cow Party(最短路+思维)

摘要：描述 One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A to 阅读全文

posted @ 2018-10-05 23:56 大桃桃阅读(188) 评论(0) 推荐(0)

TZOJ 4602 高桥和低桥(二分或树状数组+二分)

摘要：描述有个脑筋急转弯是这样的：有距离很近的一高一低两座桥，两次洪水之后高桥被淹了两次，低桥却只被淹了一次，为什么？答案是：因为低桥太低了，第一次洪水退去之后水位依然在低桥之上，所以不算“淹了两次”。举例说明：假定高桥和低桥的高度分别是5和2，初始水位为1第一次洪水：水位提高到6（两个桥都被淹），退到阅读全文

posted @ 2018-10-05 00:23 大桃桃阅读(216) 评论(0) 推荐(0)