- 博客(38)
- 资源 (1)
- 收藏
- 关注
原创 Hust oj 2000 极差(水题)
极差Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 211(141 users)Total Accepted: 155(136 users)Rating: Special Judge: NoDescription小辉是个顽皮的胖
2016-08-31 23:19:42 593
原创 Hust oj 1284 编辑距离(DP)
编辑距离Time Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 290(116 users)Total Accepted: 151(109 users)Rating: Special Judge: NoDescription俄罗斯科学家
2016-08-30 12:47:46 492
原创 Hust oj 1241 Blocks(暴力)
BlocksTime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 74(29 users)Total Accepted: 46(27 users)Rating: Special Judge: NoDescriptionDonald w
2016-08-29 23:50:32 448
原创 排序算法之归并排序
目标算法:快速排序应用范围:排序算法代码:#include#include#include#include#includeusing namespace std;const int Maxn = 5005;int a[Maxn];int c[Maxn];int n;void Merge(int l,int m,int r){ int i =
2016-08-29 19:33:35 404
原创 Hust oj 1526 小猴与冒泡(归并排序求逆序数)
小猴和冒泡Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 196(61 users)Total Accepted: 67(43 users)Rating: Special Judge: NoDescription小猴
2016-08-29 19:31:18 644
原创 Hust oj 1151 追求(暴力)
追求Time Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 236(61 users)Total Accepted: 54(47 users)Rating: Special Judge: NoDescription经历了那晚的竹林深
2016-08-28 23:25:41 711
原创 Hust oj 1186 青蛙过河(dp)
青蛙过河Time Limit: 1000 MSMemory Limit: 65535 KTotal Submit: 289(83 users)Total Accepted: 109(76 users)Rating: Special Judge: NoDescription在河上有一座独木
2016-08-28 22:31:39 2801
原创 Hust oj 1116 选美大赛(LIS + 打印路径)
选美大赛Time Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 846(237 users)Total Accepted: 280(194 users)Rating: Special Judge: NoDescription一年一度
2016-08-28 00:40:46 766
转载 Java序列化的原理
Java序列化的原理前沿 欢迎进入JDK源码阅读之序列化专题!java序列化从JDK1.1版本就开始,是一项比较成熟的技术。对于初学者可能很容易就能学会如何编写序列化类,但是对其详细的原理以及一些细节上的技术了解还是比较少的。本专题将分三个部分从JDK源代码的角度向大家介绍java序列化相关的知识: Part1:对序列化协议做出比较深入的探讨,最后总结出序列化的基本算法;
2016-08-21 18:40:04 312
原创 Pku oj 1005 I Think I Need a Houseboat(简单几何)
I Think I Need a HouseboatTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 98880 Accepted: 43050DescriptionFred Mapper is considering purchasing some lan
2016-08-13 12:07:05 253
原创 Pku oj 1004 Financial Management(水题)
Financial ManagementTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 176043 Accepted: 66198DescriptionLarry graduated this year and finally has a job. He
2016-08-13 11:23:02 369
原创 Pku oj 1003 Hangover(水题)
HangoverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 118241 Accepted: 57788DescriptionHow far can you make a stack of cards overhang a table? If you
2016-08-13 11:17:54 376
原创 Hdu 1028 Ignatius and the Princess III(整数拆分问题,DP)
Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18932 Accepted Submission(s): 13303Problem Description
2016-08-10 21:30:52 453
原创 Hust oj 1673 2013新的旅程(水题)
2013新的旅程Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 225(127 users)Total Accepted: 135(120 users)Rating: Special Judge: NoDescription
2016-08-10 11:34:39 526
原创 Hust oj 1693 Difficult work(水题)
Difficult workTime Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 147(58 users)Total Accepted: 80(50 users)Rating: Special Judge: NoDescription
2016-08-09 16:42:07 350
原创 Hdu oj 1556 Color the ball(树状数组区间更新转单点更新)
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16851 Accepted Submission(s): 8399Problem DescriptionN个气球排成一排,从左到右依
2016-08-09 11:58:36 290
原创 Pku oj 1308 Is It A Tree?(并查集)
Is It A Tree?Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29455 Accepted: 10080DescriptionA tree is a well-known data structure that is either empty
2016-08-09 11:54:56 320
原创 Pku oj 1182 食物链(带权并查集)
食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 63605 Accepted: 18675Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都
2016-08-09 11:52:29 326
原创 Pku oj 1611 The Suspects(并查集)
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 33795 Accepted: 16383DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumo
2016-08-09 11:50:34 324
原创 Pku oj 2104(划分树)
K-th NumberTime Limit: 20000MS Memory Limit: 65536KTotal Submissions: 48842 Accepted: 16489Case Time Limit: 2000MSDescriptionYou are working for Macrohard c
2016-08-09 11:46:57 331
原创 Pku oj 3468 A Simple Problem with Integers(线段树Lazy标记)
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 95170 Accepted: 29652Case Time Limit: 2000MSDescriptionYou have N i
2016-08-09 11:44:08 337
原创 Hdu oj 1213 How Many Tables(并查集)
How Many TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24819 Accepted Submission(s): 12382Problem DescriptionToday is Ign
2016-08-09 11:41:29 259
原创 UVALive 2191 Potentiometers(线段树RMQ)
A potentiometer, or potmeter for short, is an electronic device with a variable electric resistance. Ithas two terminals and some kind of control mechanism (often a dial, a wheel or a slide) with wh
2016-08-09 11:40:03 419
原创 Hdu 2089 不要62(数位dp入门)
不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 34498 Accepted Submission(s): 12474Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音:lao
2016-08-09 10:48:58 412
原创 Hdu oj 3068 最长回文(manacher算法模板题)
最长回文Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17329 Accepted Submission(s): 6377Problem Description给出一个只由小写英文字符a,b,c...y,z组
2016-08-09 10:40:01 336
转载 Manacher算法--O(n)回文子串算法
O(n)回文子串算法注:转载的这篇文章,我发现下面那个源代码有点bug。。。在下一篇博客中改正了。。 这里,我介绍一下O(n)回文串处理的一种方法。Manacher算法.原文地址:http://zhuhongcheng.wordpress.com/2009/08/02/a-simple-linear-time-algorithm-for-finding-lo
2016-08-09 10:04:01 276
原创 Pku oj 3624 Charm Bracelet(01背包)
Charm BraceletTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 33944 Accepted: 15053DescriptionBessie has gone to the mall's jewelry store and spies a ch
2016-08-09 08:47:49 288
原创 Pku oj 2533 Longest Ordered Subsequence(LIS)
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 47001 Accepted: 20883DescriptionA numeric sequence of ai is ordered if a1 a2
2016-08-09 08:45:09 336
原创 Pku oj 3071 Football(概率dp)
FootballTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4829 Accepted: 2451DescriptionConsider a single-elimination football tournament involving 2n t
2016-08-09 08:40:24 323
原创 Pku oj 2250 Compromise(LCS+打印路径)
CompromiseTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8149 Accepted: 3517 Special JudgeDescriptionIn a few months the European Currency Union wi
2016-08-08 17:07:18 379
原创 Hdu oj 4632 Palindrome subsequence(区间dp)
Palindrome subsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65535 K (Java/Others)Total Submission(s): 3054 Accepted Submission(s): 1252Problem DescriptionIn mat
2016-08-08 14:12:08 323
原创 Hust oj 2043 长长长长龙(线段树RMQ)
长长长长龙Time Limit: 3000 MSMemory Limit: 32768 KTotal Submit: 248(96 users)Total Accepted: 87(73 users)Rating: Special Judge: NoDescription时间:今
2016-08-08 12:52:29 345
原创 Hust oj 1631 技能修炼(拓扑排序)
技能修炼Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 39(25 users)Total Accepted: 26(24 users)Rating: Special Judge: NoDescription寒假第三次周
2016-08-08 11:07:47 371
原创 并查集
目标算法:并查集应用范围:元素祖先判断#include#include#include#includeusing namespace std;const int maxn = 30005;int set[maxn];int ans[maxn];int n,m;int num;void init(){ for(int i=0;i<n;i++)
2016-08-04 10:34:38 218
原创 TSP问题(状压DP+Floyd解决方式)
目标算法:状态压缩DP+Floyd应用范围:TSP#include#include#includeusing namespace std;int map[12][12];int dp[1<<11][12];int n,ans,Min;const int Inf = 0x3f3f3f;int main(){ while(~scanf("%d",&n) &
2016-08-03 14:31:52 2224
原创 Pku oj 3311 Hie with the Pie(TSP问题)
Hie with the PieTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6561 Accepted: 3546DescriptionThe Pizazz Pizzeria prides itself in delivering pizzas to
2016-08-03 14:29:08 320
原创 Pku oj 3264 Balanced Lineup(RMQ)
Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 46162 Accepted: 21674Case Time Limit: 2000MSDescriptionFor the daily milking, Farme
2016-08-03 11:34:12 377
原创 RMQ算法之Sparse Table算法
目标算法:Sparse Table算法应用范围:RMQ#include#include#include#includeusing namespace std;const int maxn = 50005;int dpmax[maxn][20];int dpmin[maxn][20];int a[maxn];int n,m;void InitRmq(){
2016-08-03 11:23:57 461
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人