poj 3311 状压dp 最短路
摘要:C -Hie with the PieTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionThe Pizazz Pizzeria pr...
阅读全文
posted @
2014-08-31 16:30
njczy2010
阅读(257)
推荐(0)
POJ1185 炮兵阵地 状态压缩DP
摘要:B -炮兵阵地Time Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M...
阅读全文
posted @
2014-08-30 10:53
njczy2010
阅读(276)
推荐(0)
ZOJ 3306 状压dp
摘要:转自:http://blog.csdn.net/a497406594/article/details/38442893Kill the MonstersTime Limit: 7 Seconds Memory Limit: 32768 KB In order to celebrate the 8t...
阅读全文
posted @
2014-08-27 18:32
njczy2010
阅读(181)
推荐(0)
zoj 3627#模拟#枚举
摘要:Treasure Hunt IITime Limit: 2 Seconds Memory Limit: 65536 KBThere are n cities(1, 2, ... ,n) forming a line on the wonderland. city i and city i+1 ...
阅读全文
posted @
2014-08-26 20:06
njczy2010
阅读(226)
推荐(0)
Codeforces 432D Prefixes and Suffixes kmp
摘要:手动转田神的大作:http://blog.csdn.net/tc_to_top/article/details/38793973D. Prefixes and Suffixestime limit per test1:secondmemory limit per test:256 megabytes...
阅读全文
posted @
2014-08-25 19:15
njczy2010
阅读(545)
推荐(0)
hdu 4778 Gems Fight! 状压dp
摘要:转自wdd:http://blog.csdn.net/u010535824/article/details/38540835题目链接:hdu 4778状压DP 用DP[i]表示从i状态选到结束得到的最大值代码也来自wdd 1 /*********************************...
阅读全文
posted @
2014-08-25 18:52
njczy2010
阅读(220)
推荐(0)
CodeForces 379D 暴力 枚举
摘要:D. New Year Lettertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMany countries have such a New ...
阅读全文
posted @
2014-08-24 20:00
njczy2010
阅读(468)
推荐(0)
HDU 4022 stl multiset
摘要:orz kss太腻害了。一、set和multiset基础set和multiset会根据特定的排序准则,自动将元素进行排序。不同的是后者允许元素重复而前者不允许。需要包含头文件:#include set和multiset都是定义在std空间里的类模板:二、set和multiset的功能和所有关联式容器...
阅读全文
posted @
2014-08-24 19:55
njczy2010
阅读(411)
推荐(0)
手动转一下田神的2048
摘要:手动转一下田神的2048:http://blog.csdn.net/tc_to_top/article/details/38793869命令行之20482048挺火的游戏,在命令行实现是什么样呢?小尝试了下,这里感谢css大神给debug,还有就是游戏空格处采用特殊字符,因此程序在linux下跑可能...
阅读全文
posted @
2014-08-24 11:05
njczy2010
阅读(224)
推荐(0)
【ZOJ】3785 What day is that day? ——KMP 暴力打表找规律
摘要:转自:http://www.cnblogs.com/kevince/p/3887827.html 首先声明一下,这里的规律指的是循环,即找到最小循环周期。 这么一说大家心里肯定有数了吧,“不就是next数组性质的应用嘛”,没错,正是如此。 在ACM的比赛中有些时候会遇到一些题目,可以或必须通过找出数
阅读全文
posted @
2014-08-23 09:46
njczy2010
阅读(477)
推荐(0)
poj 3254 状压dp
摘要:E -Corn FieldsTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 3254DescriptionFarmer John has purchased a lus...
阅读全文
posted @
2014-08-22 19:08
njczy2010
阅读(182)
推荐(0)
poj 3083 dfs,bfs
摘要:传送门 Children of the Candy Corn Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 3083 传送门 Children of th
阅读全文
posted @
2014-08-22 17:52
njczy2010
阅读(344)
推荐(0)
【黑科技】读写优化 orz bdd
摘要:转自bdd:http://www.cnblogs.com/kevince/p/3924688.html读入优化: 1 inline int read() 2 { 3 char ch; 4 bool flag = false; 5 int a = 0; 6 ...
阅读全文
posted @
2014-08-20 15:18
njczy2010
阅读(199)
推荐(0)
hdu 4960 记忆化搜索 DP
摘要:Another OCD PatientTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 490Accepted Submission(s): 1...
阅读全文
posted @
2014-08-20 14:31
njczy2010
阅读(173)
推荐(0)
hdu 4965 矩阵快速幂 矩阵相乘性质
摘要:Fast Matrix CalculationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 170Accepted Submission(s...
阅读全文
posted @
2014-08-19 19:46
njczy2010
阅读(248)
推荐(0)
hdu 4961 数论 o(nlogn)
摘要:Boring SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 60Accepted Submission(s): 30 Problem ...
阅读全文
posted @
2014-08-19 18:17
njczy2010
阅读(391)
推荐(0)
CodeForces 438D 线段树 剪枝
摘要:D. The Child and Sequencetime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAt the children's day, ...
阅读全文
posted @
2014-08-18 18:33
njczy2010
阅读(266)
推荐(0)
HDU 3853 概率dp
摘要:LOOPSTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others) Total Submission(s): 2337Accepted Submission(s): 951 Problem De...
阅读全文
posted @
2014-08-17 21:18
njczy2010
阅读(203)
推荐(0)
POJ 3468 线段树 成段更新 懒惰标记
摘要:A Simple Problem with Integers Time Limit:5000MS Memory Limit:131072K Case Time Limit:2000MS Description You have N integers, A1, A2, ... , AN. You ne
阅读全文
posted @
2014-08-17 10:45
njczy2010
阅读(161)
推荐(0)
hdu 1717
摘要:小数化分数2Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3037Accepted Submission(s): 1237 Problem De...
阅读全文
posted @
2014-08-15 21:39
njczy2010
阅读(240)
推荐(0)
hdu 4951
摘要:Multiplication table Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 435 Accepted Submission(s):
阅读全文
posted @
2014-08-15 12:21
njczy2010
阅读(309)
推荐(0)
hdu 4952
摘要:Number Transformation Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 418 Accepted Submission(s)
阅读全文
posted @
2014-08-14 22:00
njczy2010
阅读(345)
推荐(0)
hdu 4937 2014 Multi-University Training Contest 7 1003
摘要:Lucky NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 664Accepted Submission(s): 194 Prob...
阅读全文
posted @
2014-08-13 12:15
njczy2010
阅读(216)
推荐(0)
hdu 4941 2014 Multi-University Training Contest 7 1007
摘要:Magical Forest Time Limit: 24000/12000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 134 Accepted Submission(s): 6
阅读全文
posted @
2014-08-12 19:01
njczy2010
阅读(217)
推荐(0)
hdu 4939 2014 Multi-University Training Contest 7 1005
摘要:Stupid Tower Defense Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 151 Accepted Submission(
阅读全文
posted @
2014-08-12 18:38
njczy2010
阅读(216)
推荐(0)
hdu 4932 BestCoder Round #4 1002
摘要:这题真是丧心病狂,引来今天的hack狂潮~Miaomiao's GeometryTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 10Accepte...
阅读全文
posted @
2014-08-10 21:11
njczy2010
阅读(222)
推荐(0)
POJ 2362
摘要:知识点:dfs(深度优先搜索) 题解:基本的dfs搜索判断可行性问题。一般的dfs搜索,如果不加剪枝,复杂度是指数级的,所以必须要能发掘出优秀的剪枝条件; 在本题中,一般有如下剪枝: ①:所有线段的长度之和必须为4的倍数;②:搜索之前,把所有线段按从大到小排序,因为长度越长,在拼凑时的灵活度就越低;
阅读全文
posted @
2014-08-09 16:55
njczy2010
阅读(345)
推荐(0)