E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
FatMouse
暑假-动态规划 I-(H -
FatMouse
's Speed)
/* 题意: 要求找到的体重递增,速度递减的老鼠,并且输出最长的长度数,而且输出各自的序列数。 (SpecialJudge说明答案不唯一,只要输出的答案正确就可以) 转换方程: dp[i]=max(0,dp[j]|(ja[j].w&&a[i].s #include #include usingnamespacestd; #defineINF1000000 structNode//保存数据的容器 {
slime_kirito
·
2015-07-21 10:00
dp
HDU 1009
FatMouse
' Trade
题目地址:点击打开链接思路:贪心AC代码:#include #include #include usingnamespacestd; structMouse { doublea; doubleb; doublec; }; boolcomp(constMouse&d1,constMouse&d2) { returnd1.c>d2.c; } intmain() { intm,n,i; doublesu
qq_25605637
·
2015-07-20 21:00
YT05-动态归划求解课后题目-1001—
FatMouse
's Speed-(6.21日-烟台大学ACM预备队解题报告)
FatMouse
'sSpeedTimeLimit:2000/1000ms(Java/Other) MemoryLimit:65536/32768K(Java/Other)TotalSubmission
MIKASA3
·
2015-07-15 16:00
C++
HDOJ----------1009
题目:
FatMouse
' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536
·
2015-07-02 13:00
OJ
hdu 1009 贪心
FatMouse
'TradeTimeLimit:2000/1000MS(Java/Others) MemoryLimit:65536/32768K(Java/Others)TotalSubmission
qq_24489717
·
2015-06-13 15:00
[hdu]
FatMouse
' Trade
TimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):51783AcceptedSubmission(s):17369ProblemDescriptionFatMousepreparedMpoundsofcatfood,readytotradewiththecatsguar
CoinJ
·
2015-06-05 19:24
贪心法
[hdu]
FatMouse
' Trade
TimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):51783AcceptedSubmission(s):17369ProblemDescriptionFatMousepreparedMpoundsofcatfood,readytotradewiththecatsguar
CoinJ
·
2015-06-05 19:24
贪心法
杭电1009(
FatMouse
' Trade)
FatMouse
' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768
·
2015-06-03 12:00
杭电
HDU
FatMouse
' Trade
FatMouse
'TradeTimeLimit:2000/1000ms(Java/Other) MemoryLimit:65536/32768K(Java/Other)TotalSubmission
zp___waj
·
2015-05-26 12:00
十一周——杭电——1001
FatMouse
' Trade
问题描述
FatMouse
'TradeTimeLimit:2000/1000ms(Java/Other) MemoryLimit:65536/32768K(Java/Other)TotalSubmission
lily1143
·
2015-05-24 16:00
FatMouse
's Speed(HDU-1160)
一道经典的最长子序列题,不过该题需要维护两个量,体重和速度,所以需要先对一个量进行排序,然后剩下的那个量就可以像处理最长子序列那样做了。值得一提的是该题需要打印路径,最好的方法是用一个数组pre运用类似链表的结构,来记录路径。这恰恰就是紫书上数据结构那章例题14中所用的记录最短路路径的方法。其中的巧妙和实现细节请读者细细品味。 针对这道题,由于dp是利用之前计算的结果进行递推得到的,因此,每一步的
weizhuwyzc000
·
2015-05-18 15:00
ACM
hdoj
【HDU】 1160
FatMouse
's Speed (DP)
一开始写的dfs进行记忆化结果不知道怎么进行路径的记录。。。改成循环就好了dp[i]=max(dp[j])+1,weight[j]speed[i]一开始进行一次排序使得重量递增,这样只需要考虑速度就好了#include #include usingnamespacestd; constintmaxn=10005; structMouse{ intw,s,id; friendbooloperator
u013451221
·
2015-05-17 11:00
FatMouse
' Trade(hdoj1009)
Problem Description
FatMouse
prepared M pounds of cat food, ready to trade with the cats guarding the
·
2015-05-12 14:00
tr
【贪心专题】HDU 1009
FatMouse
' Trade (贪心选取)
链接:clickhere~~题意:老鼠准备了M磅猫食,准备拿这些猫食跟猫交换自己喜欢的食物。有N个房间,每个房间里面都有食物。你可以得到J[i]单位的食物,但你需要付出F[i]单位的的猫食。计算M磅猫食可以获得最多食物的重量。【解题思路】贪心算法,求最优解。将J[i]/F[i]的值从大到小排列,每次取最大的,局部最优,达到全局最优,从而获得最大值。代码://贪心策略,优先选择投资最大的房间,每选择
u013050857
·
2015-04-06 22:00
HDU
贪心
HDU 1009
FatMouse
' Trade
#include #include #include #include #include #include usingnamespacestd; structHome{doublej;doublef;doublediv;}num[1001]; //structDDiv{doublediv[1001];}num1; //intcmp(constvoid*a,constvoid*b)//这个cmp
xinwen1995
·
2015-03-29 11:00
zoj 2109
FatMouse
' Trade 贪心
#include #include #include #include #include usingnamespacestd; structdata { doublej,f,x; }a[1024]; boolcmp(dataa,datab) { returna.x>b.x; } intmain() { intm,n,i; doublesum; while(~scanf("%d%d",&m,&n)
xinag578
·
2015-03-15 18:00
hdu-1160
FatMouse
's Speed 【最长上升子序列】
pid=1160
FatMouse
'sSpeedTimeLimit:2000/1000MS(Java/Others) MemoryLimit:65536/32768K(Java/Others)TotalSubmission
u014427196
·
2015-03-02 11:00
Hduoj1160【DP】
/*
FatMouse
'sSpeed TimeLimit:2000/1000ms(Java/Other)MemoryLimit:65536/32768K(Java/Other) TotalSubmission
u014641529
·
2015-02-17 08:00
FatMouse
' Trade
题目来源:http://acm.hdu.edu.cn/showproblem.php?pid=1009本题作为贪心的基础题,很简单,并且本人认为结构体排序最形象直观,但是在做题的时候要注意01 和10 这两组测试数据,否则会WR代码:#include #include #include #include #include usingnamespacestd; structT{ intcatfood
u014665013
·
2015-02-16 21:00
(hdu step 3.2.4)
FatMouse
's Speed(在第一关键字升序的情况下,根据第二关键字来求最长下降子序列)
抱歉了,希望大家多多支持我在CSDN的视频课程,地址如下:http://edu.csdn.net/course/detail/209题目:
FatMouse
'sSpeedTimeLimit:2000/1000MS
caihongshijie6
·
2015-02-10 17:00
ZOJ 2109
FatMouse
's Trade(贪心)
题意:简单的贪心题,选择性价比高的。最后不够的,不必取整。代码:#include #include #include #include usingnamespacestd; structroom { intjavabean,catFood; doublerate; }; boolcmp(rooma,roomb) { returna.rate>b.rate; } intmain() { intamo
David_Jett
·
2015-02-03 22:00
贪心
简单题
HDOJ 1009
FatMouse
' Trade
FatMouse
'TradeTimeLimit:2000/1000ms(Java/Other) MemoryLimit:65536/32768K(Java/Other)TotalSubmission
zwj1452267376
·
2014-12-27 19:00
hdu1009
FatMouse
' Trade
pid=1009译文:题目描述: 从前有只肥肥的老鼠,他叫
FatMouse
,他就像人类的恐怖分子跟敌人交易军火一样,猥琐的他准备了M磅猫食,准备与守卫仓库的大猫们进行交易,仓库里有他最爱吃的食物
luomingjun12315
·
2014-12-17 21:00
HDU1078_
FatMouse
and Cheese【记忆化搜索】
FatMouseandCheeseTimeLimit:2000/1000MS(Java/Others) MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):5124 AcceptedSubmission(s):2076ProblemDescriptionFatMousehasstoredsomecheeseinacity.Thecit
u011676797
·
2014-11-26 15:00
HDU1160_
FatMouse
's Speed【LIS变形】
FatMouse
'sSpeedTimeLimit:2000/1000MS(Java/Others) MemoryLimit:65536/32768K(Java/Others)TotalSubmission
u011676797
·
2014-11-25 22:00
Language of
FatMouse
(输入输出格式+STL的map)
Link:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1109ZOJProblemSet-1109LanguageofFatMouseTimeLimit: 10Seconds MemoryLimit: 32768KBWeallknowthatFatMousedoesn'tspeakEnglish.Butnowhe
Enjoying_Science
·
2014-11-09 15:00
map
ACM
STL
hdu1009-
FatMouse
' Trade --- 贪心算法
TimeLimit:2000/1000MS(Java/Others) MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):44989 AcceptedSubmission(s):15050ProblemDescriptionFatMousepreparedMpoundsofcatfood,readytotradewiththe
u012965373
·
2014-11-09 01:00
[HDU 1078]
FatMouse
and Cheese(记忆化DFS)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1078题目大意:一个胖老鼠要在一个n*n大小的棋盘里吃奶酪,这个老鼠每一步最多能走k单位远,而且每走一步,必须走到比当前点奶酪数多的点那去。告诉你这个棋盘里每个点上的奶酪个数,求这个老鼠最多能吃多少奶酪。思路:类似于棋盘DP的记忆化DFS,直接搜加记忆答案就可以了。#include #include #
qpswwww
·
2014-11-06 16:00
hdu 1160
FatMouse
's Speed(贪心)
ProblemDescriptionFatMousebelievesthatthefatteramouseis,thefasteritruns.Todisprovethis,youwanttotakethedataonacollectionofmiceandputaslargeasubsetofthisdataaspossibleintoasequencesothattheweightsarein
Misdom_Tian_Ya
·
2014-10-31 17:00
hdu 1009
FatMouse
' Trade(贪心)
ProblemDescriptionFatMousepreparedMpoundsofcatfood,readytotradewiththecatsguardingthewarehousecontaininghisfavoritefood,JavaBean.ThewarehousehasNrooms.Thei-throomcontainsJ[i]poundsofJavaBeansandrequir
Misdom_Tian_Ya
·
2014-10-31 17:00
HDU1009_
FatMouse
' Trade【贪心】【水题】
FatMouse
'TradeTimeLimit:2000/1000MS(Java/Others) MemoryLimit:65536/32768K(Java/Others)TotalSubmission
u011676797
·
2014-10-19 19:00
九度题目1433:
FatMouse
(贪心算法)
题目描述:FatMousepreparedMpoundsofcatfood,readytotradewiththecatsguardingthewarehousecontaininghisfavoritefood,JavaBean.ThewarehousehasNrooms.Thei-throomcontainsJ[i]poundsofJavaBeansandrequiresF[i]poundso
zhoubin1992
·
2014-10-13 22:00
Algorithm
编程
C++
ACM
贪心算法
HDU 1160
FatMouse
's Speed (最長單調递增子序列 dp)
鏈接: http://acm.hdu.edu.cn/showproblem.php?pid=1160ProblemDescriptionFatMousebelievesthatthefatteramouseis,thefasteritruns.Todisprovethis,youwanttotakethedataonacollectionofmiceandputaslargeasubsetofth
u012823258
·
2014-09-04 13:00
dp
HDU1009 贪心思想
FatMouse
'TradeTimeLimit:1000MS MemoryLimit:32768KB 64bitIOFormat:%I64d&%I64uSubmit Status Practice
u013068502
·
2014-09-02 21:00
贪心思想
HDU 1078
FatMouse
and Cheese 动态规划 + DFS
题目大意:就是现在有一个n*n的矩阵,每个矩阵上对应一个数字代表进入该位置能得到的能量(奶酪),现在老鼠从点(0,0)除法要求每次只能水平或者竖直方向移动不超过k格,并且每次移动到的新位置的能量之比原来的位置的能量值高,走过的位置不能再走,问最终能得到的能量的最大值大致思路:用dp[i][j]表示到位置(i,j)的能量最大值,那么用dfs搜索接下能移动到的位置,对于已经走过的位置记忆话搜索即可代码
u013738743
·
2014-08-25 02:00
动态规划
HDU
DFS
and
Cheese
1078
FatMouse
FatMouse
and Cheese(HDU 1078) —— 记忆化搜索DP
FatMouseandCheeseTimeLimit:2000/1000MS(Java/Others) MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):4884 AcceptedSubmission(s):1987ProblemDescriptionFatMousehasstoredsomecheeseinacity.Thec
jxust_tj
·
2014-08-24 09:00
动态规划
记忆化搜索
ACMICPC
FatMouse
's Speed
pid=1160Original Problem:
FatMouse
'sSpeedTimeLimit:2000/1000MS(Java/Others) MemoryLimit:65536/32768K
Enjoying_Science
·
2014-08-20 19:00
算法
动态规划
ACM
HDU
FatMouse
's Speed(HDU 1160)—— DP记录路径
FatMouse
'sSpeedTimeLimit:2000/1000MS(Java/Others) MemoryLimit:65536/32768K(Java/Others)TotalSubmission
jxust_tj
·
2014-08-19 22:00
动态规划
最长上升子序列
记录路径
HDU1009
FatMouse
' Trade 贪心
#include #include #include usingnamespacestd;constintMAX=1001;typedefstruct{intf,j;doubleans;}change; changefood[MAX];doublecmp(constchange&a,constchange&b){returna.ans=food[i].f){ max+=food[i].j
AC_Gibson
·
2014-08-13 11:00
Hdu 1009
FatMouse
' Trade
FatMouse
' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768
·
2014-08-11 20:00
HDU
1408111555-hd-
FatMouse
' Trade.cpp
FatMouse
'Trade TimeLimit
wangluoershixiong
·
2014-08-11 16:00
HDU 1160
FatMouse
's Speed (最长有序的上升子序列)
题意:给你一系列个w,s,要你找到最长的n使得W[m[1]]S[m[2]]>...>S[m[n]]即在这n个w,s中满足w[i]s[j],要求:体重严格递增,速度严格递减,原始顺序不定首先将s从大到小排序,即顺数固定后转化为最长上升子序列问题.案例: 60081300 60002100 5002000 10004000 11003000 60002000 80001400 6000120
u012861385
·
2014-08-05 10:00
Hduoj1009!【水题】
/*
FatMouse
'Trade TimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/32768K(Java/Others) TotalSubmission
u014641529
·
2014-07-29 19:00
HDU1078:
FatMouse
and Cheese(记忆化)
ProblemDescriptionFatMousehasstoredsomecheeseinacity.Thecitycanbeconsideredasasquaregridofdimensionn:eachgridlocationislabelled(p,q)where0 #include #include usingnamespacestd; intn,k,dp[105][105],a[1
libin56842
·
2014-07-27 17:00
dp
HDU
DFS
HDU 1009
FatMouse
' Trade (贪心、结构体排序)
这是一道基本的贪心算法题,运用结构体排序知识,一次就AC了。 不过耗时有点多,62ms,用什么办法可以解决呢?请高手指点。 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1009#include structfood { floatp,f,j; }; intmain() { foodfo[1000],temp; intm,n,i,j
yzj577
·
2014-07-22 19:00
C++
算法
冒泡排序
struct
hdu 1009
FatMouse
' Trade (水题,贪心)
小记:这题比较水思路:将J[i]/F[i]的值进行从大到小排序,然后依次贪心代码:#include #include #include #include #include #include #include #include #include #include #include usingnamespacestd; #definemst(a,b)memset(a,b,sizeof(a)) #d
ljd4305
·
2014-07-22 18:00
HDU 1009
FatMouse
' Trade
pid=1009
FatMouse
' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit:
hellojyj
·
2014-07-16 14:00
贪心算法
HDU 1009
部分背包
hdu1078
FatMouse
and Cheese(记忆化搜索)
转载请注明出处:http://blog.csdn.net/u012860063题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1078ProblemDescriptionFatMousehasstoredsomecheeseinacity.Thecitycanbeconsideredasasquaregridofdimensionn:eachgridl
u012860063
·
2014-06-26 10:00
动态规划
HDU
DFS
杭电OJ(HDU)-ACMSteps-Chapter Three-《
FatMouse
' Trade》《今年暑假不AC》《排名》《开门人和关门人》
chapterid=1§ionid=31.3.1
FatMouse
'Trade #include /* 题意:价值/代价的比值来排序,买比值大的。
caisini_vc
·
2014-06-22 10:00
Algorithm
ACM
HDU
基本功
杭电oj
贪心 --- 模板题
FatMouse
' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768
·
2014-05-26 18:00
模板
上一页
3
4
5
6
7
8
9
10
下一页
按字母分类:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他