ACM
文章平均质量分 65
夨落旳尐孩
我要这天,再遮不住我眼,要这地,再埋不了我心,要这众生,都明白我意,要那诸佛,都烟消云散。
展开
-
纠结的动态规划
这个下午我在实验室看计算机的动态规划算法,纠结的让人烦,可是还是要坚持原创 2013-09-11 14:01:35 · 831 阅读 · 0 评论 -
hdu 1789 Doing Homework again
Doing HomeworkagainTime Limit : 1000/1000ms(Java/Other) MemoryLimit : 32768/32768K (Java/Other)Total Submission(s) :12 AcceptedSubmission(s) : 8Font: Times NewRoman | Verdana | Georgia原创 2013-09-11 14:02:05 · 705 阅读 · 0 评论 -
hdu 1391 Number Steps
NumberStepsTime Limit : 2000/1000ms(Java/Other) MemoryLimit : 65536/32768K (Java/Other)Total Submission(s) :43 AcceptedSubmission(s) : 28Font: Times NewRoman | Verdana | GeorgiaFont原创 2013-09-11 14:02:07 · 678 阅读 · 0 评论 -
动态规划练习题
SuperJumping! Jumping! Jumping!TimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 65536/32768 K (Java/Others)Total Submission(s):9076 AcceptedSubmission(s): 3699Problem DescriptionNo原创 2013-09-11 14:02:32 · 829 阅读 · 0 评论 -
qsort()排序函数
原文地址:qsort()排序函数作者:奔跑的乌龟n 排序是最常用的预处理技术n qsort包含在头文件中n 函数根据你给的比较条件进行快速排序n 排序之后的结果仍然放在原数组中n 使用qsort函数必须自己写一个比较函数。一、对整型数组排序Int main(){ inta[10]={4,2,7,3,6,1,5}; inti,n=7; qsort(a转载 2013-09-11 14:02:49 · 787 阅读 · 0 评论 -
线段树 count color
Count ColorTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 21764Accepted: 6336DescriptionChosen Problem Solving and Program design as anoptional course, you are required t原创 2013-09-11 14:02:58 · 737 阅读 · 0 评论 -
线段树练习Balanced Lineup
Balanced LineupTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 18995Accepted: 8776Case Time Limit: 2000MSDescriptionFor the daily milking, FarmerJohn's N cows (1≤ N原创 2013-09-11 14:03:11 · 698 阅读 · 0 评论 -
树状数组hdu1166 敌兵布阵
敌兵布阵TimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 65536/32768 K (Java/Others)Total Submission(s):8562 AcceptedSubmission(s): 3557Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以C国间谍头子D原创 2013-09-11 14:03:16 · 574 阅读 · 0 评论 -
树状数组题目总结
原文地址:树状数组题目总结作者:东丹筱什么是树状数组?参见http://blog.sina.com.cn/s/blog_49c5866c0100f4l7.htmlhoj 1867经理的烦恼 此题是最基本的一维树状数组题目,直接进行简单的加一减一(通过判素)操作即可。hoj 2430 Counting thealgorithms 从后往前不断删除(这样的话不存在区间包含问题转载 2013-09-11 14:03:22 · 755 阅读 · 0 评论 -
树状数组 poj 2352 Stars
StarsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 18416Accepted: 8041DescriptionAstronomers often examine star maps where starsare represented by points on a plane and原创 2013-09-11 14:03:31 · 689 阅读 · 0 评论 -
寒冰王座
寒冰王座Time Limit : 2000/1000ms(Java/Other) MemoryLimit : 65536/32768K (Java/Other)Total Submission(s) :15 AcceptedSubmission(s) : 10Font: Times NewRoman | Verdana | GeorgiaFont Size: ←原创 2013-09-11 14:03:52 · 748 阅读 · 0 评论 -
水题 Parity
ParityTime Limit : 2000/1000ms(Java/Other) MemoryLimit : 32768/32768K (Java/Other)Total Submission(s) :11 AcceptedSubmission(s) : 10Font: Times NewRoman | Verdana | GeorgiaFont Size:原创 2013-09-11 14:03:54 · 652 阅读 · 0 评论 -
水题 A Simple Task
A Simple TaskTime Limit : 2000/1000ms(Java/Other) MemoryLimit : 65536/32768K (Java/Other)Total Submission(s) :18 AcceptedSubmission(s) : 11Font: Times NewRoman | Verdana | GeorgiaFont原创 2013-09-11 14:03:56 · 680 阅读 · 0 评论 -
有关栈的代码模板
数组实现的栈#include#include#define N100structnode{intdata[N];inttop;intbase;}zhan;voidintistack(struct node *s){s->top=s->base=0;}intstackempty(struct node *s){returns->top==s->bas原创 2013-09-11 14:03:59 · 699 阅读 · 0 评论 -
栈的练习 Train Problem I
Train Problem ITimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 65536/32768 K (Java/Others)Total Submission(s):6794 AcceptedSubmission(s): 2486Problem DescriptionAs the new term com原创 2013-09-11 14:04:01 · 714 阅读 · 0 评论 -
循环队列 约瑟夫问题
约瑟夫问题Time Limit: 1000MS Memory limit: 65536K题目描述n个人想玩残酷的死亡游戏,游戏规则如下: n个人进行编号,分别从1到n,排成一个圈,顺时针从1开始数到m,数到m的人被杀,剩下的人继续游戏,活到最后的一个人是胜利者。请输出最后一个人的编号。输入输入n和m值。输出输出胜利者的编号。示例输入5原创 2013-09-11 14:04:03 · 1550 阅读 · 0 评论 -
hdu 1157 Who's in the Middle(poj…
2011ACM/ICPC中国大陆赛区信息汇集~Who's inthe MiddleTimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 65536/32768 K (Java/Others)Total Submission(s):3467 AcceptedSubmission(s): 1707Problem原创 2013-09-11 14:04:07 · 697 阅读 · 0 评论 -
一个不错的资料网站 维基百科
维基百科原创 2013-09-11 14:04:14 · 691 阅读 · 0 评论 -
poj 2299 Ultra-QuickSort 归并排…
Ultra-QuickSortTime Limit: 7000MSMemory Limit: 65536KTotal Submissions: 22296Accepted: 7943Description2299 Ultra-QuickSort 归并排序求逆序数" TITLE="poj 2299 Ultra-QuickSort 归并排序求逆序数" />In原创 2013-09-11 14:04:16 · 714 阅读 · 0 评论 -
简单的二叉树 hdu 3791
2011ACM/ICPC中国大陆赛区信息汇集~二叉搜索树TimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 32768/32768 K (Java/Others)Total Submission(s):237 AcceptedSubmission(s): 111Problem Description判断两原创 2013-09-11 14:04:23 · 707 阅读 · 0 评论 -
trie树练习 Hat’s Words
Hat’s WordsTimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 65536/32768 K (Java/Others)Total Submission(s):2174 AcceptedSubmission(s): 791Problem DescriptionA hat’s word is a word i原创 2013-09-11 14:04:27 · 599 阅读 · 0 评论 -
阿里巴巴程序设计大赛结题报告
2011.8.18阿里巴巴程序设计大赛原创 2013-09-11 14:04:32 · 728 阅读 · 0 评论 -
堆排序 hdu 2020 绝对值排序
绝对值排序TimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 65536/32768 K (Java/Others)Total Submission(s):15473 AcceptedSubmission(s): 7661Problem Description输入n(n Input输入数据有多组,每组原创 2013-09-11 14:04:34 · 560 阅读 · 0 评论 -
(拓扑排序 )hdu 2094 产生冠军
产生冠军TimeLimit: 1000/1000 MS(Java/Others) MemoryLimit: 32768/32768 K (Java/Others)Total Submission(s):3241 AcceptedSubmission(s): 1595Problem Description有一群人,打乒乓球比赛,两两捉对撕杀,每两个人之间最多打一场原创 2013-09-11 14:04:36 · 783 阅读 · 0 评论 -
拓扑排序 hdu 2647 Reward
2011ACM/ICPC亚洲区中国大陆5个赛区信息汇集RewardTimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 32768/32768 K (Java/Others)Total Submission(s):868 AcceptedSubmission(s): 260Problem Descriptio原创 2013-09-11 14:04:40 · 737 阅读 · 0 评论 -
大整数加法 1002 A + B Problem II
A + B Problem IITimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 65536/32768 K (Java/Others)Total Submission(s):81691 AcceptedSubmission(s): 15350Problem DescriptionI have a very si原创 2013-09-11 14:04:55 · 788 阅读 · 0 评论 -
hdu 1854 Q-Sequence
Q-SequenceTimeLimit: 1000/1000 MS(Java/Others) MemoryLimit: 32768/65535 K (Java/Others)Total Submission(s):423 AcceptedSubmission(s): 200Problem DescriptionA Q-sequence is defined as:原创 2013-09-11 14:05:00 · 781 阅读 · 0 评论 -
DP Bone Collector(01背包问题)
Bone CollectorTimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 32768/32768 K (Java/Others)Total Submission(s):8097 AcceptedSubmission(s): 3041Problem DescriptionMany years ago , in原创 2013-09-11 14:05:06 · 621 阅读 · 0 评论 -
hdu 2550 百步穿杨
百步穿杨TimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 32768/32768 K (Java/Others)Total Submission(s):2542 AcceptedSubmission(s): 942Problem Description时维九月,序属三秋,辽军大举进攻MCA山,战场上两军正交锋.辽原创 2013-09-11 14:05:09 · 713 阅读 · 0 评论 -
Filthy Rich(动态规划)
Filthy RichTimeLimit: 10000/5000 MS(Java/Others) MemoryLimit: 32768/32768 K (Java/Others)Total Submission(s):695 AcceptedSubmission(s): 379Problem DescriptionThey say that in Phrygia原创 2013-09-11 14:05:17 · 740 阅读 · 0 评论 -
hdu 1086
You canSolve a Geometry Problem tooTimeLimit: 2000/1000 MS(Java/Others) MemoryLimit: 65536/32768 K (Java/Others)Total Submission(s):2865 AcceptedSubmission(s): 1355Problem Description原创 2013-09-11 14:05:30 · 689 阅读 · 0 评论 -
hdu 3125 Slash
SlashTimeLimit: 1000/1000 MS(Java/Others) MemoryLimit: 131072/131072 K (Java/Others)Total Submission(s):417 AcceptedSubmission(s): 244Problem DescriptionThe American English slash (/原创 2013-09-11 14:05:44 · 789 阅读 · 0 评论 -
ACM大牛胡浩的博客
http://www.notonlysuccess.com/?p=217原创 2013-09-11 14:05:55 · 1569 阅读 · 0 评论 -
成都赛区 1009
The Social NetworkTimeLimit: 3000/2000 MS(Java/Others) MemoryLimit: 65768/65768 K (Java/Others)Problem DescriptionThe social network system (SNS) helps people to keep connectingwith their原创 2013-09-11 14:06:06 · 885 阅读 · 0 评论 -
成都赛区 1004
GraphTime Limit: 2000/1000 MS(Java/Others) MemoryLimit: 65768/65768 K (Java/Others)Problem DescriptionEveryone knows how to calculate the shortest path in a directedgraph. In fact, the opp原创 2013-09-11 14:06:08 · 1006 阅读 · 0 评论 -
The 36th ACM/ICPC Asia Regional …
WarTime Limit: 2000/1000 MS(Java/Others) MemoryLimit: 32768/32768 K (Java/Others)Total Submission(s):291 AcceptedSubmission(s): 216Problem DescriptionPhage War is a little flash g原创 2013-09-11 14:06:21 · 722 阅读 · 0 评论 -
hdu 1097 A hard puzzle
hdu 1097 A hard puzzle好吧,这个题我承认我没有快速幂取模,我找的规律通过尾数的的规律你会发现,尾数为0,1,5,6的不管是多少次方尾数依然不变,而尾数为4和9的每2次循环,2,3,7,8为每4次循环,就是这么水过啦~~~~~!!!#includeusing namespace std;intldigit[10][4]={{0},{1},{6,2,4,8},{1,原创 2013-09-11 14:07:37 · 761 阅读 · 0 评论 -
HDU 动态规划(46道题目)倾…
原文地址:动态规划(46道题目)倾情奉献">HDU 动态规划(46道题目)倾情奉献作者:奔跑的乌龟Robberies OJ地址: http://acm.hdu.edu.cn/showproblem.php?pid=2955 背包;第一次做的时候把概率当做背包(放大100000倍化为整数):在此范围内最多能抢多少钱 最脑残的是把总的概率以为是抢N家银行的转载 2013-09-11 14:01:30 · 817 阅读 · 0 评论 -
背包九讲
原文地址:背包九讲作者:奔跑的乌龟P01:01背包问题题目有N件物品和一个容量为V的背包。第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包可使价值总和最大。基本思路这是最基础的背包问题,特点是:每种物品仅有一件,可以选择放或不放。用子问题定义状态:即f[i][v]表示前i件物品恰放入一个容量为v的背包可以获得的最大价值。则其状态转移方程便是:f转载 2013-09-11 14:01:33 · 554 阅读 · 0 评论 -
五大常用算法之四:回溯法
原文地址:五大常用算法之四:回溯法作者:smartpigling回溯法1、概念 回溯算法实际上一个类似枚举的搜索尝试过程,主要是在搜索尝试过程中寻找问题的解,当发现已不满足求解条件时,就“回溯”返回,尝试别的路径。 回溯法是一种选优搜索法,按选优条件向前搜索,以达到目标。但当探索到某一步时,发现原先选择并不优或达不到目标,就退回一步重新选择,这种走不通就退回再走的技转载 2013-09-11 14:01:37 · 820 阅读 · 0 评论