码迷,mamicode.com
首页 >  
搜索关键字:crb and candies    ( 410个结果
575. 分配糖果 Distribute Candies
Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of th... ...
分类:其他好文   时间:2017-05-13 22:10:03    阅读次数:173
[LeetCode] Distribute Candies 分糖果
Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of th ...
分类:其他好文   时间:2017-05-13 00:32:59    阅读次数:154
leetcode575
https://leetcode.com/problems/distribute-candies/#/description ...
分类:其他好文   时间:2017-05-09 12:37:20    阅读次数:130
[leetcode-575-Distribute Candies]
Given an integer array with even length, where different numbers in this array represent different kinds of candies.Each number means one candy of the ...
分类:其他好文   时间:2017-05-07 12:53:10    阅读次数:229
hzau 1207 Candies
1207: Candies Description Xiao Ming likes those N candies he collects very much. There are two kinds of candies, A and B. One day, Xiao Ming puts his ...
分类:其他好文   时间:2017-04-30 23:00:10    阅读次数:286
HZAU 1207 Candies(线段树区间查询 区间修改)
【题目链接】http://acm.hzau.edu.cn/problem.php?id=1207 【题意】给你一个字符串,然后两种操作:1,将区间L,R更新为A或者B,2,询问区间L,R最长的连续的B为多长。 【分析】典型线段树,每个节点维护该区间左边连续B的长度,右边连续B的长度,最长的连续B的长 ...
分类:其他好文   时间:2017-04-24 00:08:13    阅读次数:324
hdu5411 CRB and Puzzle
CRB and Puzzle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1177 Accepted Submission(s): 468 P ...
分类:其他好文   时间:2017-04-18 11:25:54    阅读次数:310
poj 3159 Candies(dijstra优化非vector写法)
题目链接:http://poj.org/problem?id=3159 题意:给n个人派糖果,给出m组数据,每组数据包含A,B,c 三个数,意思是A的糖果数比B少的个数不多于c,即B的糖果数 - A的糖果数<= c 。 最后求n比1最多多多少糖果。 可以从条件中的 B-A<=c及B<=A+c最后要达 ...
分类:Web程序   时间:2017-03-14 20:24:00    阅读次数:176
(线段树,反素数)poj2886-Who Gets the Most Candies?
N children are sitting in a circle to play a game. The children are numbered from 1 to N in clockwise order. Each of them has a card with a non-zero i ...
分类:其他好文   时间:2017-02-17 17:01:46    阅读次数:297
poj3159 Candies
题意: 有N个孩子(N<=3000)分糖果。有M个关系(M<=150,000)。每个关系形如:A B C表示第B个学生比第A个学生多分到的糖果数目,不能超过C求第N个学生最多比第1个学生能多分几个糖果 思路: dijkstra+heap 实现: ...
分类:其他好文   时间:2017-01-26 12:23:43    阅读次数:178
410条   上一页 1 ... 14 15 16 17 18 ... 41 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!