码迷,mamicode.com
首页 >  
搜索关键字:planning    ( 748个结果
House Robber && House RobberⅡ
House Robber && House RobberⅡ 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...
分类:其他好文   时间:2015-08-28 13:16:56    阅读次数:146
决策理论(Decision theory)&自动规划和调度(Automated planning and scheduling)(双语)
译的不好,还请见谅。。。 大部分内容来自wiki decision theory决策理论部分: Normative and descriptive decision theory 规范和描述性决策理论 规范或规范的决策理论关心的是确定最好的决定(在实践中,有些情况下,“最好”的不一定是最大,最优可能还包括值除了最大,但在特定或近似范围),假设一个理想的决策者充分了...
分类:其他好文   时间:2015-08-27 23:11:22    阅读次数:473
UVA 4854 A Digital Satire of Digital Age(模拟)
The government of “Moderdesh” is planning to enter the digital age and so people of different profession and business are proposing different ways to enter that age successfully. The hardware vendors...
分类:其他好文   时间:2015-08-20 19:01:34    阅读次数:204
hdu 3624 City Planning(暴力,也可扫描线)
City Planning Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 503    Accepted Submission(s): 213 Problem Description After many yea...
分类:其他好文   时间:2015-08-19 16:52:23    阅读次数:81
HDU 3634 City Planning (离散化)
City PlanningTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 483Accepted Submission(s): 203Problem...
分类:其他好文   时间:2015-08-16 16:36:14    阅读次数:86
Uva 12569 Planning mobile robot on Tree (EASY Version)
基本思路就是Bfs: 本题的一个关键就是如何判段状态重复。 1.如果将状态用一个int型数组表示,即假设为int state[17],state[0]代表机器人的位置,从1到M从小到大表示障碍物的位置。那么如果直接用STL中的set是会超时的,但如果自己建立一个hash方法,像这样: int...
分类:其他好文   时间:2015-08-16 13:40:26    阅读次数:129
poj 2688 Cleaning Robot (tsp问题)
Cleaning RobotTime Limit:1000MSMemory Limit:65536KTotal Submissions:4073Accepted:1659DescriptionHere, we want to solve path planning for a mobile robo...
分类:其他好文   时间:2015-08-16 07:03:56    阅读次数:288
Lettcode_198_House Robber
本文是在学习中的总结,欢迎转载但请注明出处:http://blog.csdn.net/pistolove/article/details/47680663 You are a professional robber planning to rob houses along a street. Each house has a certain amount of money...
分类:其他好文   时间:2015-08-15 13:34:40    阅读次数:208
HDU 3634 City Planning (离散化)
题意  给你n个矩形  每个矩形都有自己的value  你可以任意改变矩形的表里关系   被覆盖的地方的value取最表层的   求总value的最大值 刚看了扫描线  感觉这个可以用扫描线做就直接写了  其实直接离散化就行了  因为最多也就20个矩形  那坐标最多也就40个  那我们对坐标进行离散化  然后将矩形按value从小到大一个个的放  暴力更新覆盖格子的value  最后直接将2n ...
分类:其他好文   时间:2015-08-14 09:58:19    阅读次数:195
HDU 4289 Control(最大流,最小割)
Problem Description: You, the head of Department of Security, recently received a top-secret information that a group of terrorists is planning to tr....
分类:其他好文   时间:2015-08-13 19:42:15    阅读次数:142
748条   上一页 1 ... 56 57 58 59 60 ... 75 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!