![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
hdu
文章平均质量分 78
Lawrence_Jang
这个作者很懒,什么都没留下…
展开
-
hdu 3622 bomb game
hdu 3622 bomb gametwo_satN组,每组2个坐标,选择一个放置炸弹,范围为半径为ri的圆 要求是任意的两个圆不能相交,N小于等于100 最后的得分是N个圆的最小半径 现在求的是最大得分容易想到二分答案 并进行可行性分析那么算法就有了。1:确定上下界、2:二分3:判断是否可行4:在精度范围内则跳出最终二分的解就是答案 #incl原创 2012-10-15 16:28:41 · 445 阅读 · 0 评论 -
hdu 2870 Largest Submatrix
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7f7f#define linf 1000000000000000000LL#defin原创 2012-11-05 18:41:35 · 371 阅读 · 0 评论 -
hdu 2830 Matrix Swapping II
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7f7f#define linf 1000000000000000000LL#defin原创 2012-11-05 18:57:01 · 370 阅读 · 0 评论 -
hdu 1159 dp lcs nlogn解法
#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7f7f#define linf 1000000000000000000LL#define dinf 1e200#define eps 1e-11#define lng lo原创 2012-11-05 21:03:11 · 808 阅读 · 0 评论 -
hdu 1421 搬寝室
#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7f7f#define linf 1000000000000000000LL#define dinf 1e200#define eps 1e-11#define lng lo原创 2012-11-06 18:38:42 · 392 阅读 · 0 评论 -
hdu 3732 多重背包
一开始看以为是01 背包 仔细一看发现好多重复 于是写了个单调队列优化的多重背包直接跑了 156ms 46名 心里不爽 优化优化 加了个外挂 直接飙到第一#include#include#include#include#include#include#include#include#include#include#include#include#include原创 2012-10-27 16:29:21 · 498 阅读 · 0 评论 -
hdu 1058 humble numbers
恶心的输出#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7f7f#define linf 1000000000000000000LL#define dinf 1e200#define eps 1e-11#define原创 2012-11-06 19:27:45 · 454 阅读 · 0 评论 -
hdu 1789
对于可以补的subject 应该优先考虑分数大的 并且尽量延后时间,只需要按照分值大小排序然后依次安排即可#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7f7f#define linf 10000000000000原创 2012-11-07 15:30:01 · 436 阅读 · 0 评论 -
Java BigInteger hdu 1720 为例
import java.io.IOException;import java.math.BigDecimal;import java.math.BigInteger;import java.util.Scanner;public class Main{ static Scanner c=new Scanner(System.in); static BigInteger f(Str原创 2013-03-13 20:25:03 · 896 阅读 · 0 评论 -
hdu1753 看着简单写着蛋疼的题挺好的
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7f7f#define linf 1000000000000000000LL#defin原创 2012-10-25 21:51:19 · 397 阅读 · 0 评论 -
hdu 1231 最大连续子序列 yy+dp+数据结构解法
1:线段树解法 对于每一个i求出最大的(i-k)区间内的sum值及id#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7f7f#def原创 2012-10-23 17:41:46 · 979 阅读 · 0 评论 -
hdu 4359 easy tree dp? dp+combination
5000组case每组数据一个N,D分别为节点数和深度求满足性质的二叉树个数mod 1e9+7对于非叶子节点r有性质如下leftsumN个节点的值已经确定为1到2^N-1的等比序列N D小于等于360从结果的大小来看不可能直接枚举出很显然 val[k]=sigma(val[1~k-1])+1val[k]=val[k-1]*2也就是说任意一个子原创 2012-10-18 13:12:16 · 397 阅读 · 0 评论 -
hdu 1069
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7f7f#define linf 1000000000000000000LL#defin原创 2012-10-30 16:37:44 · 414 阅读 · 0 评论 -
hdu 1505 city game
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7f7f#define linf 1000000000000000000LL#defin原创 2012-10-31 15:33:14 · 415 阅读 · 0 评论 -
hdu 1506 dp
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7f7f#define linf 1000000000000000000LL#defin原创 2012-10-31 15:17:37 · 398 阅读 · 0 评论 -
hdu 4433 天津赛饮恨的c题·····事后才想出来
这题状态的设计主要在于后效性的消除,每步操作最多影响后面两位 然后预处理(枚举)出转移#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7原创 2012-11-01 16:05:18 · 1240 阅读 · 0 评论 -
hdu 2955 水题却wa几次值得反思
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7f7f#define linf 1000000000000000000LL#defin原创 2012-10-23 11:14:53 · 426 阅读 · 0 评论 -
hdu 2845 dp
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7f7f#define linf 1000000000000000000LL#defin原创 2012-11-02 11:04:58 · 419 阅读 · 0 评论 -
hdu 2577 dp
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define iinf 0x7f7f7f7f#define linf 1000000000000000000LL#defin原创 2012-11-01 15:36:05 · 427 阅读 · 0 评论 -
Java sort 的比较函数写法
import java.io.IOException;import java.util.Arrays;import java.util.Scanner;import java.lang.Integer;public class Main{ static Scanner c=new Scanner(System.in); public static class Stu implemen原创 2013-03-14 17:40:37 · 5507 阅读 · 0 评论