- 博客(14)
- 问答 (2)
- 收藏
- 关注
原创 poj1080 Human Gene Functions
Human Gene FunctionsTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 18536 Accepted: 10295Description It is well known that a human gene can be considered as a sequence, consist
2016-03-31 16:17:21 657
原创 poj3252 Round Numbers
Round NumbersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11387 Accepted: 4263DescriptionThe cows, as you know, have no fingers or thumbs and thus ar
2016-03-31 09:27:03 653
原创 poj 1080 Human Gene Functions
Human Gene Functions--------------------Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18536 Accepted: 10295DescriptionIt is well known that a human gene can be considered as a seq
2016-03-30 15:33:19 487
原创 POJ - 3083 Children of the Candy Corn 中文题意+题解
POJ - 3083**Children of the Candy Corn==========================**Time Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionThe cornfield maze is a
2016-03-21 16:56:56 765
原创 3192: [JLOI2013]删除物品
3192: [JLOI2013]删除物品Time Limit: 10 Sec Memory Limit: 128 MB Submit: 123 Solved: 77 [Submit][Status][Discuss] Description箱子再分配问题需要解决如下问题: (1)一共有N个物品,堆成M堆。 (2)所有物品都是一样的,但是它们有不同的优先级。 (3)你只能够移动某
2016-03-18 21:07:04 403
原创 2821: 作诗(Poetize)
**2821: 作诗(Poetize)** !!!暴力是不对的!!!----------------------------------Time Limit: 50 Sec Memory Limit: 128 MBSubmit: 2347 Solved: 669[Submit][Status][Discuss]Description神犇SJY虐完HEOI之后给傻×LYD出了一
2016-03-18 13:52:51 698
原创 二分图强连通分量 tarjan 模板
#include#include#include#include#define maxx 200000using namespace std;int a,b,c,d,n,m;int cnt,fail,biao;//cnt是每个强连通分量的编号//fail是栈sta的指针//biao用于给节点编号int sta[maxx],belong[max
2016-03-14 20:36:21 418
原创 shupou
#include#include#include#includeusing namespace std;const int maxx=140000;vector lin[maxx];int deep[maxx],fa[maxx],top[maxx],in[maxx],bs[maxx];int dfs1(int x,int pre,int d){
2016-03-08 21:41:32 408
原创 线段数求和模板
/*上次实现了线段树上的求组区间最大值操作,现在来实现求区间和的操作,其实代码兵没哟修改多少同理,拿走的童鞋请点个赞,谢谢本文章是个人作品,可以转载,因为你知道的太多了,如果你心情好,带上地址吧,我叫WilliamCode*/#include#include#include#define lson id*2 //id的左子树编号#define rson i
2016-03-08 16:40:52 918
原创 线段树模板
/*××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××××线段树模板,先自学线段树原理这里单点修改,区间查询最大值的代码最小值只需要把max改成min即可注意ans初始化线段书的求和等其他操作稍后将更新于微博本文章属个人作
2016-03-08 15:37:54 1882
原创 BestCoder Round #74 (div.2) LCP Array
真是TMD,bestcoder 73 竟然做了一天LCP Array Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1087 Accepted Submission(s): 306Problem Descri
2016-03-07 20:52:57 568
原创 POJ - 1451 T9
POJ - 1451T9Time Limit: 1000MS Memory Limit: 10000KB 64bit IO Format: %I64d & %I64uSubmitStatus DescriptionBackground A while ago it was quite cumbers
2016-03-02 15:06:43 867
原创 POJ - 3691 DNA repair
POJ - 3691DNA repairTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uSubmitStatus DescriptionBiologists finally invent technique
2016-03-01 18:55:59 667
空空如也
新手java编程:在ArrayList中嵌套ArrayList,好像忘写了什么,数据丢失
2017-10-20
简单的java程序编译失败
2017-10-17
TA创建的收藏夹 TA关注的收藏夹
TA关注的人