动态规划DP

SOJ2113: 数字游戏题解动态规划DP

2113:数字游戏Submityoursolution   Discussthisproblem   Bestsolutions Description【问题描述】丁丁最近沉迷于一个数字游戏之中。这个游戏看似简单，但丁丁在研究了许多天之后却发觉原来在简单的规则下想要赢得这个游戏并不那么容易。游戏是这样的，在你面前有一圈整数（一共n个），你要按顺序将其分为m个部分，各部分内的数字相加，相加所得的m个
power721·2010-08-19 13:00

2010 ACM-ICPC Multi-University Training Contest(5)HDU3485Count 101题解动态规划DP

Count101TimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):400    AcceptedSubmission(s):219ProblemDescriptionYouknowYaoYaoisfondofhischains.Hehasalotofchains
power721·2010-08-18 12:00

SOJ2818: QQ音速题解动态规划DP

2818:QQ音速Submityoursolution   Discussthisproblem   Bestsolutions  Description 最近flymouse开始玩qq音速，这个游戏只需要按4个键，上，下，左，右（分别用u,d,l,r表示）。 flymouse必须按照游戏规则，依次按下一系列键。问题是flymouse的手太胖了，他只能把两个手指放在方向键上。 flymo
power721·2010-08-17 22:00

JLU2686awake点兵题解动态规划DP

http://acm.jlu.edu.cn/joj/showproblem.php?pid=2686awake点兵题目描述大战在即，awake将军招募了n名士兵，但是俗语云“兵多非益”，于是awake将军决定从这n名士兵中选择m个人组成一个兵团。每个人都有两个属性，一个是战斗力vi，另一个是相性wi，我们规定，任意两人的相性之差|wi-­‐wj|为此二人的相性差。相性差越大，二人便会越合不来。aw
power721·2010-08-17 20:00

题解动态规划DP

3732:I'mAttackingtheDarkness! Submityoursolution   Discussthisproblem   Bestsolutions  TimeLimit:3000MSMemoryLimit:65536K Description Manytabletoprole-playinggames(RPGs),suchasaratherfam
power721·2010-08-16 13:00

HDU2386Dart Challenge题解动态规划DP

DartChallengeTimeLimit:4000/2000MS(Java/Others)    MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):268    AcceptedSubmission(s):134ProblemDescriptionClarkandHarryaresiblings.Astheyhadbeenrival
power721·2010-08-13 19:00

POJ3132Sum of Different Primes题解动态规划DP

SumofDifferentPrimesTimeLimit:5000MS MemoryLimit:65536KTotalSubmissions:2160 Accepted:1334DescriptionApositiveintegermaybeexpressedasasumofdifferentprimenumbers(primes),inonewayoranother.Giventwoposit
power721·2010-08-12 19:00

HIT2954PD EERT题解动态规划DP

http://acm.hit.edu.cn/judge/show.php?Proid=2954&Contestid=0PDEERT Timelimit:1sec.Submitted:82Memorylimit:64MAccepted:35Source:PerfectCai&XnozeroDescriptionMaybeyouhavelearnedthedatastructure--Tree.Now
power721·2010-08-12 19:00

ZOJ2059The Twin Towers题解动态规划DP

TheTwinTowersTimeLimit:1Second    MemoryLimit:32768KBTwintowersweseeyoustandingtall,thoughabuilding'slostourfaithwillneverfall.Twintowerstheworldhearsyourcall,thoughyou'regoneitonlystrengthensourresol
power721·2010-08-12 19:00

POJ1062昂贵的聘礼题解动态规划DP

昂贵的聘礼TimeLimit:1000MS MemoryLimit:10000KTotalSubmissions:15476 Accepted:4108Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币，便请求酋长降低要求。酋长说："嗯，如果你能够替我弄到大祭司的皮袄
power721·2010-08-12 14:00

POJ2030The Secret Number题解动态规划DP

TheSecretNumberTimeLimit:1000MS MemoryLimit:30000KTotalSubmissions:1682 Accepted:554DescriptionYourjobistofindoutthesecretnumberhiddeninamatrix,eachofwhoseelementisadigit('0'-'9')oraletter('A'-'Z').Yo
power721·2010-08-11 16:00

POJ1651Multiplication Puzzle题解动态规划DP

MultiplicationPuzzleTimeLimit:1000MS MemoryLimit:65536KTotalSubmissions:3460 Accepted:2034DescriptionThemultiplicationpuzzleisplayedwitharowofcards,eachcontainingasinglepositiveinteger.Duringthemovepl
power721·2010-08-11 15:00

POJ1745Divisibility题解动态规划DP

DivisibilityTimeLimit:1000MS MemoryLimit:10000KTotalSubmissions:6514 Accepted:2161DescriptionConsideranarbitrarysequenceofintegers.Onecanplace+or-operatorsbetweenintegersinthesequence,thusderivingdiff
power721·2010-08-11 12:00

POJ3186Treats for the Cows题解动态规划DP

TreatsfortheCowsTimeLimit:1000MS MemoryLimit:65536KTotalSubmissions:2686 Accepted:1280DescriptionFJhaspurchasedN(1#definemax(a,b)((a)>(b)?(a):(b))intdp[2002][2002];intmain(){intn,i,j,a[2002];scanf("%d
power721·2010-08-11 11:00

[SCOI2009]windy数 题解动态规划DP

[SCOI2009]windy数TimeLimit:1000MS MemoryLimit:165536KTotalSubmit:162Accepted:74Descriptionwindy定义了一种windy数。不含前导零且相邻两个数字之差至少为2的正整数被称为windy数。windy想知道，在A和B之间，包括A和B，总共有多少个windy数？Input包含两个整数，AB。Output一个整数。S
power721·2010-08-11 11:00

HDU2059龟兔赛跑-题解动态规划DP

龟兔赛跑TimeLimit:1000/1000MS(Java/Others)    MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):3538    AcceptedSubmission(s):1277ProblemDescription据说在很久很久以前，可怜的兔子经历了人生中最大的打击——赛跑输给乌龟后，心中郁闷，发誓要报仇雪恨，于
power721·2010-08-10 14:00

POJ2264Advanced Fruits题解动态规划DP

AdvancedFruitsTimeLimit:1000MS MemoryLimit:65536KTotalSubmissions:1078 Accepted:543 SpecialJudgeDescriptionThecompany"21stCenturyFruits"hasspecializedincreatingnewsortsoffruitsbytransferringgenesfromo
power721·2010-08-10 14:00

HDU2845Beans题解动态规划DP

 BeansTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):616    AcceptedSubmission(s):315ProblemDescriptionBean-eatingisaninterestinggame,everyoneownsanM*Nma
power721·2010-08-09 22:00

POJ1018Communication System题解动态规划DP

CommunicationSystemTimeLimit:1000MS MemoryLimit:10000KTotalSubmissions:12607 Accepted:4377DescriptionWehavereceivedanorderfromPizoorCommunicationsInc.foraspecialcommunicationsystem.Thesystemconsistsof
power721·2010-08-06 16:00

HDU1158Employment Planning题解动态规划DP

EmploymentPlanningTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):1288    AcceptedSubmission(s):481ProblemDescriptionAprojectmanagerwantstodeterminethenum
power721·2010-08-04 21:00

POJ2353Ministry题解动态规划DP

MinistryTimeLimit:1000MS MemoryLimit:65536KTotalSubmissions:2849 Accepted:864 SpecialJudgeDescriptionMr.F.wantstogetadocumentbesignedbyaminister.Aministersignsadocumentonlyifitisapprovedbyhisministry.
power721·2010-08-04 16:00

POJ1952BUY LOW, BUY LOWER题解动态规划DP

BUYLOW,BUYLOWERTimeLimit:1000MS MemoryLimit:30000KTotalSubmissions:4652 Accepted:1563DescriptionTheadviceto"buylow"ishalftheformulatosuccessinthebovinestockmarket.Tobeconsideredagreatinvestoryoumustal
power721·2010-08-02 21:00

POJ1141Brackets Sequence动态规划DP

BracketsSequenceTimeLimit:1000MS MemoryLimit:65536KTotalSubmissions:12516 Accepted:3353 SpecialJudgeDescriptionLetusdefinearegularbracketssequenceinthefollowingway:1.Emptysequenceisaregularsequence.2.
power721·2010-08-02 20:00

POJ1160Post Office动态规划DP

PostOfficeTimeLimit:1000MS MemoryLimit:10000KTotalSubmissions:8856 Accepted:4726DescriptionThereisastraighthighwaywithvillagesalongsidethehighway.Thehighwayisrepresentedasanintegeraxis,andthepositiono
power721·2010-08-02 20:00

POJ1080Human Gene Functions动态规划DP

HumanGeneFunctionsTimeLimit:1000MS MemoryLimit:10000KTotalSubmissions:9568 Accepted:5275DescriptionItiswellknownthatahumangenecanbeconsideredasasequence,consistingoffournucleotides,whicharesimplydenot
power721·2010-08-02 20:00

POJ2192Zipper动态规划DP

ZipperTimeLimit:1000MS MemoryLimit:65536KTotalSubmissions:8559 Accepted:2908DescriptionGiventhreestrings,youaretodeterminewhetherthethirdstringcanbeformedbycombiningthecharactersinthefirsttwostrings.T
power721·2010-08-02 20:00

POJ1463Strategic game题解动态规划DP

StrategicgameTimeLimit:2000MS MemoryLimit:10000KTotalSubmissions:2096 Accepted:870DescriptionBobenjoysplayingcomputergames,especiallystrategicgames,butsometimeshecannotfindthesolutionfastenoughandthen
power721·2010-08-01 19:00

POJ1404I-Keyboard题解动态规划DP

I-KeyboardTimeLimit:2000MS MemoryLimit:32768KTotalSubmissions:3753 Accepted:1889DescriptionMostofyouhaveprobablytriedtotypeanSMSmessageonthekeypadofacellularphone.Itissometimesveryannoyingtowritelonge
power721·2010-08-01 19:00

Bookshelf题解动态规划DP

Description Robbyboughtanewbookshelf,andhewantedtoputallhisNbooksonit.ThebookshelfcontainsKlayers, andtheheightsofeachlayerarevariable.Thatis,theminimumheightofonelayerisequaltothemaximum heighto
power721·2010-08-01 19:00

1010. Zipper

TAG  动态规划dp 使3个字符串ABCdp[i][j]表示A的前i个字符和B的前j个字符能否组合成C的前i+j个字符状态转移方程： dp[i][j]=   dp[i-1][j]&&C[i+j-1]=
Dinosoft·2010-07-10 00:00

Hilary动态规划DP

HilaryTimeLimit:1000MS MemoryLimit:65536KTotalSubmit:38Accepted:4DescriptionDearwayisfondofsleeping,buthealwaysfeelsitisnotenougheventhough8hours.Thereforeheusuallynapsinclass!!!Afterhewakesuphesometi
power721·2010-04-27 19:00

POJ1157 LITTLE SHOP OF FLOWERS题解动态规划DP

DescriptionYouwanttoarrangethewindowofyourflowershopinamostpleasantway.YouhaveFbunchesofflowers,eachbeingofadifferentkind,andatleastasmanyvasesorderedinarow.Thevasesaregluedontotheshelfandarenumberedc
power721·2009-12-03 20:00
上一页 2 3 4 5 6 7 8 9 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他