文章
PAT 1110. Complete Binary Tree
1110.CompleteBinaryTree(25)<blockquote<pGivenatree,youaresupposedtotellifitisacompletebinary<br/tree.</p<pInputSpecifi
PAT 题解
1108.FindingAverage(20)<blockquote<pThebasictaskissimple:givenNrealnumbers,youaresupposedto<br/calculatetheiraverage.But
HDU - 3350 - #define is unsafe - [基于递归的简单表达式解析]
HDU3350defineisunsafe<blockquote<p<ahref"https://link.segmentfault.com/?encweWfFb14xc9M9TFJKrf4zQ%3D%3D.JprJw1M88P05tsvy5nhA2Y3e
HDU - 1201 - 18岁生日 - [局部分离思想]
HDU120118岁生日<blockquote<p<ahref"https://link.segmentfault.com/?encgibZqY29lIcylU%2B9dcOQ7g%3D%3D.pIaLR8lb8bau3i84fT1zWN3R4BeEj9eXAX
SPOJ - MKEQUAL
SPOJMKEQUALMakethemequal!<blockquote<p<ahref"https://link.segmentfault.com/?encFB7NirKGpn0%2BvvtrNm4pxg%3D%3D.WaWHs%2Fj732otiBjO5
leetcode讲解--343. Integer Break
343.IntegerBreak题目地址(https://link.segmentfault.com/?encEu%2F62W1NT1rULv0FINccPQ%3D%3D.5%2FXViguuvR6Bw2CAdaaEdDtjXh1hmPEjTXeJYg73pp39nYlMPD
leetcode讲解--217. Contains Duplicate
217.ContainsDuplicateGivenanarrayofintegers,findifthearraycontainsanyduplicates.Yourfunctionshouldreturntrueifanyvalueapp
leetcode讲解--169. Majority Element
169.MajorityElementGivenanarrayofsizen,findthemajorityelement.Themajorityelementistheelementthatappearsmorethan⌊n/2⌋ti
Codeforces 721D Maxim and Array
预习功课我通过这个题接触到了stl中的heap。以前都是用set啊啥的,然而如果你把n个元素全都插入到set里复杂度是相当的高的。这个时候heap就产生了,而且heap有一个好,它的内部不是有序的,要求没有那么严格,所以这个时候我们就要用heap了。heap的使用
Codeforces 721C Journey
题意给你<coden</code个点、<codem</code条有向边的图,边有长度,现在要从<code1</code号点走向<coden</code号点,希望在总路径不超过<codeT</code的情况下经过尽可能多的点。题目保证有解,输出经过的点的方案。
已加载文章中没有匹配内容,试试其他关键词或清空搜索。