码迷,mamicode.com
首页 >  
搜索关键字:amount    ( 1179个结果
Program D--贪心-区间覆盖
Given several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would completely cov...
分类:其他好文   时间:2015-08-09 22:21:45    阅读次数:146
hiho一下 第五十八周 Beautiful String dp
题目1 : Beautiful String 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 We say a string is beautiful if it has the equal amount of 3 or more continuous letters (in increasing order.) H...
分类:其他好文   时间:2015-08-09 17:19:59    阅读次数:138
(leetcode)House Robber
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo...
分类:其他好文   时间:2015-08-09 00:13:33    阅读次数:225
Oracle按不同时间分组统计
Oracle按不同时间分组统计Oracle按不同时间分组统计的sql如下表table1: 日期(exportDate) 数量(amount) -------------- ----------- 14-2月 -08 ...
分类:数据库   时间:2015-08-08 19:45:19    阅读次数:265
D 贪心,区间覆盖问题
Given several segments of line (int the X axis) with coordinates [Li , Ri ]. You are to choose the minimal amount of them, such they would completely ...
分类:其他好文   时间:2015-08-07 21:58:11    阅读次数:137
UVA 10020 - Minimal coverage 解题心得
原题:The ProblemGiven several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would ...
分类:其他好文   时间:2015-08-07 21:49:13    阅读次数:106
2015 HUAS Summer Trainning #4~D
Given several segments of line (int the X axis) with coordinates [Li , Ri ]. You are to choose the minimal amount of them, such they would completely ...
分类:其他好文   时间:2015-08-06 22:10:06    阅读次数:100
leetCode(54):Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to ...
分类:其他好文   时间:2015-08-06 11:15:43    阅读次数:135
Jquery实现抖动效果
参考文档:jQuery 的扩展,实现抖动效果背景:在项目中,登录页验证用户名和密码是否匹配,如果不匹配,则抖动输入框,提示用户输入错误。将如下代码写到JS文件中: 1 jQuery.fn.shake = function (intShakes /*Amount of shakes*/, intDis...
分类:Web程序   时间:2015-08-05 21:54:04    阅读次数:335
UVa 10020 - Minimal coverage(区间覆盖并贪心)
Given several segments of line (int the X axis) with coordinates [Li, Ri]. You are to choose the minimal amount of them, such they would completely co...
分类:其他好文   时间:2015-08-05 06:30:01    阅读次数:160
1179条   上一页 1 ... 78 79 80 81 82 ... 118 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!