Code-Dreamer的博客

问题描述： 给你一张无向图，定义环为从i出发到达j然后从j返回i并且所有点都只经过一次（最少为3个点），求所有环当中经过路径                   最小的环算法描述：首先容易想到的是暴力来枚举环，当删除其中一条边ij后再跑一边从i到j的最短路，然后加上边ij的值就是含有边ij的最小环                   的值，这样最坏的时间复杂度可以达到O(n^4)，显然复杂度有

Card Game CheaterTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1880    Accepted Submission(s): 1038Problem DescriptionAdam and

Uncle Tom's Inherited Land*Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3423    Accepted Submission(s): 1438Special JudgeProblem

50 years, 50 colorsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2498    Accepted Submission(s): 1410Problem DescriptionOn Oct

Disney's FastPassTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2406    Accepted Submission(s): 661Problem DescriptionDisne

问题描述：                  给你一张无向图或有向图，要你求任意两点的最短路条数或次短路条数算法描述：              1，最短路：                             对于最短路条数，我们很容易想到的是加法原则，我们可以在用dij求最短路的时候，                       当dis[j]=dis[to]+

WuKongTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1804    Accepted Submission(s): 672Problem DescriptionLiyuan wanted to rew

A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8176    Accepted Submission(s): 3006Problem Description

Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10274    Accepted Submission(s): 2831Problem DescriptionTh

Shortest Path                                                   Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)                                                 

The Accomodation of StudentsTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5931    Accepted Submission(s): 2703Problem Description

CactusTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1934    Accepted Submission(s): 891Problem Description1. It is a Strongly

PartyTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6168    Accepted Submission(s): 2013Problem Description有n对夫妻被邀请参加一个聚会，因为场地的

题目链接：HDU6070题目大意：给你长度为n的序列，求某个区间[l,r]使得区间内的数字种类/区间长度最小输出这个最小值题目思路：对于这种区间最优比率问题（分数规划问题）我们常规的解法是二分答案来求根据题目意思我们二分答案后可以转化成size(l,r)/(r-l+1)<=mid -> size(l,r)+l*mid <=(r+1)*mid这里我们可以枚举右边的r ，然后用最值线段

题目链接：hdu6069题目大意： 给你三个数l,r,k 求 $$\sum_{i=0}^n i^2 = \frac{(n^2+n)(2n+1)}{6}$$

Keywords SearchTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 63350    Accepted Submission(s): 21015Problem DescriptionIn the

PondsTime Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 4259    Accepted Submission(s): 1233Problem DescriptionBetty owns a lot o

Alisha’s PartyTime Limit: 3000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 6064    Accepted Submission(s): 1461Problem DescriptionPrincess

OO’s SequenceTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3800    Accepted Submission(s): 1403Problem DescriptionOO has got

Aragorn's StoryTime Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11303    Accepted Submission(s): 2948Problem DescriptionOur prot

Legal or NotTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7925    Accepted Submission(s): 3748Problem DescriptionACM-DIY is a

欧拉回路Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14227    Accepted Submission(s): 5388Problem Description欧拉回路是指不令笔离开纸面，可画过图中每

Delay Constrained Maximum Capacity PathTime Limit: 10000/10000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1876    Accepted Submission(s): 619Problem

find the longest of the shortestTime Limit: 1000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3120    Accepted Submission(s): 1148Problem Descript

Marriage Match IITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3819    Accepted Submission(s): 1250Problem DescriptionPresumab

Cat vs. DogTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2113    Accepted Submission(s): 817Problem DescriptionThe latest real

A Magic LampTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3728    Accepted Submission(s): 1515Problem DescriptionKiki likes tr

IntervieweTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6766    Accepted Submission(s): 1606Problem DescriptionYaoYao has a co

Connections between citiesTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10158    Accepted Submission(s): 2428Problem Description

PS：这是get姿势后的第一道建图稍微麻烦的题，居然写完代码没调试一次AC了~~~哈哈~~~~WarTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1386    Accepted Submission(s)

问题描述：  求一个s-t平面图当中的最小割算法描述：                    几个概念：                                         1，平面图：给你的图当中没有相交的边                               2，s-t平面图：即远点与汇点位于平面图的边界

Hamburger MagiTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 737    Accepted Submission(s): 255Problem DescriptionIn the myster

[671原创，欢迎转载]以下题均为杭电acm网页的题号首页http://acm.hdu.edu.cn/题库入口http://acm.hdu.edu.cn/listproblem.php?vol=1帮助http://acm.hdu.edu.cn/faq.php?lang=chs此次培训主要锻炼同学们的算法学习，更重要的是

National TreasuresTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1295    Accepted Submission(s): 469Problem DescriptionThe grea

Fire NetTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11241    Accepted Submission(s): 6709Problem DescriptionSuppose that we

ArbiterTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1242    Accepted Submission(s): 609Problem DescriptionArbiter is a kind

问题描述：双调欧几里得旅行商问题是一个经典动态规划问题。《算法导论（第二版）》思考题15-1和北京大学OJ2677都出现了这个题目。旅行商问题描述：平面上n个点，确定一条连接各点的最短闭合旅程。这个解的一般形式为NP的（在多项式时间内可以求出）J.L. Bentley 建议通过只考虑双调旅程(bitonictour)来简化问题,这种旅程即为从最左点开始，

In ActionTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5634    Accepted Submission(s): 1886Problem DescriptionSince 1945, wh

棋盘游戏Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4501    Accepted Submission(s): 2668Problem Description小希和Gardon在玩一个游戏：对一个N*

Ollivanders: Makers of Fine Wands since 382 BC.Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1740    Accepted Submission(s): 983P