mfcheer

贪心算法

11729 Commando War“Waiting for orders we held in the wood, word from the front never came By evening the sound of the gunfire was miles away Ah softly we moved through the shadows, slip away through th

昨天北师大新生赛的题，本弱做一做。。。 贪心题，按照结束时间排序进行贪心。 http://www.bnuoj.com/v3/problem_show.php?pid=44582 MLX的疯狂睡眠 Time Limit: 1000ms Memory Limit: 65536KB 64-bit integer IO format: %lld      J

贪心算法  WA了好多    #include #include #include #include #include #define nMAX 2505 bool vs[nMAX]; struct Cow{ int min,max; }cow[nMAX]; struct Lot { int num,cnt; }lot[nMAX]; int cmp1(const voi

贪心算法：哈夫曼编码思想：

不知道为什么原来的思路就是错的 ，那也

贪心算法，把作业按照

刚开始单纯的以为 a[i] > a[i]

简单的贪心  开始的时候考虑麻烦了

DescriptionProblem C: The Dragon of LoowaterOnce upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.The shores of Rellau Creek in central Loowater had always been a p