wwwn、

分类

codeforces(4) lca(1) poj(1) RMQ(2) 位运算(1) 动态规划(4) 单调栈(1) 博弈论(4) 图论(7) 思维水题(2) 数论(2) 未归档(42) 树状数组(1) 模板水题(5) 模板记录(7) 面积几何(1) 题解(1)

/ 注册

全部文章（共86篇）

hdu2860 Regroup 简单并查集&&维护点权值

When ALPC42 got to a panzer brigade, He was asked to build software to help them regroup the battalions or companies. As the tradition of army, soldi...

2019-02-01

0 463

P1337 [JSOI2004]平衡点 / 吊打XXX 随机化搜索&&模拟退火

题目描述如图：有n个重物，每个重物系在一条足够长的绳子上。每条绳子自上而下穿过桌面上的洞，然后系在一起。图中X处就是公共的绳结。假设绳子是完全弹性的（不会造成能量损失），桌子足够高（因而重物不会垂到地上），且忽略所有的摩擦。问绳结X最终平衡于何处。注意：桌面上的洞都比绳结X小得多，所以即...

2019-01-23

0 466

hdu2866 D - Special Prime 数论+打表

Give you a prime number p, if you could find some natural number (0 is not inclusive) n and m, satisfy the following expression: D - Special Pr...

2019-01-22

0 433

hdu2864 Base B 思维&&进制题

“Base B” HDU - 2864 AekdyCoin is so fond of math.He loves Number.He knows how to express a non-negative number into P base.Say,he knows that the n...

2019-01-22

0 487

hdu 2855 Fibonacci Check-up 矩阵快速幂&&模板

Fibonacci Check-up HDU - 2855 Every ALPC has his own alpc-number just like alpc12, alpc55, alpc62 etc. As more and more fresh man join us. How...

2019-01-21

0 534

hdu2854 Central Meridian Number 数论推导||打表出奇迹

A Central Meridian (ACM) Number N is a positive integer satisfies that given two positive integers A and B, and among A, B and N, we have N | ((A^2)*...

2019-01-21

0 500

hdu2857 Mirror and Light 求两直线交点&&点关于直线的对称点&&模板

The light travels in a straight line and always goes in the minimal path between two points, are the basic laws of optics. Now, our problem is that, ...

2019-01-21

0 406

hdu2852 KiKi's K-Number 树状数组+二分查找求第k大的数

For the k-th number, we all should be very familiar with it. Of course,to kiki it is also simple. Now Kiki meets a very similar problem, kiki wants to...

2019-01-21

0 509

hdu2850 Load Balancing贪心+优先队列

In the Wide Web World, Which web server was popular in web site? Apache, nginx, lighttpd? Baidu.com use Apache, and many web sites like 163.com use ng...

2019-01-21

0 557

并查集模板

#include<iostream> using namespace std; int pre[1050]; bool t[1050]; //t 用于标记独立块的根结点 int Find(int x) { int ...

2019-01-19

0 460