码迷,mamicode.com
首页 >  
搜索关键字:poj 3150 矩阵优化    ( 20355个结果
Poj-1157-LITTLE SHOP OF FLOWERS
题意为从每行取一瓶花,每瓶花都有自己的审美价值第 i+1 行取的花位于第 i 行的右下方求最大审美价值dp[i][j]:取到第 i 行,第 j 列时所获得的最大审美价值动态转移方程:dp[i][j]=max(dp[i-1][j-1]+a[i][j],dp[i][j-1])代码如下:#includei...
分类:其他好文   时间:2014-04-30 00:17:20    阅读次数:488
POJ 3180
The Cow PromTime Limit:1000MSMemory Limit:65536KTotal Submissions:1132Accepted:713DescriptionThe N (2 2 #include 3 #include 4 #include 5 #include ...
分类:其他好文   时间:2014-04-29 21:40:26    阅读次数:564
hdu 1541/poj 2352:Stars(树状数组,经典题)
StarsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4052Accepted Submission(s): 1592Problem Descr...
分类:其他好文   时间:2014-04-29 21:00:23    阅读次数:621
POJ 1236
Network of SchoolsTime Limit:1000MSMemory Limit:10000KTotal Submissions:10500Accepted:4189DescriptionA number of schools are connected to a computer n...
分类:其他好文   时间:2014-04-29 20:33:42    阅读次数:567
POJ 3356 AGTC(DP-最小编辑距离)
DescriptionLetxandybe two strings over some finite alphabetA. We would like to transformxintoyallowing only operations given below:Deletion:a letter i...
分类:其他好文   时间:2014-04-29 16:22:00    阅读次数:450
20355条   上一页 1 ... 2034 2035 2036
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!