• 博客园logo
  • 会员
  • 众包
  • 新闻
  • 博问
  • 闪存
  • 赞助商
  • HarmonyOS
  • Chat2DB
    • 搜索
      所有博客
    • 搜索
      当前博客
  • 写随笔 我的博客 短消息 简洁模式
    用户头像
    我的博客 我的园子 账号设置 会员中心 简洁模式 ... 退出登录
    注册 登录
 






hebozi

 
 

Powered by 博客园
博客园 | 首页 | 新随笔 | 联系 | 订阅 订阅 | 管理

2012年8月11日

HDU 1024 Max Sum Plus Plus DP+空间压缩
摘要: Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10169Accepted Submission(s): 3321Problem DescriptionNow I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves 阅读全文
posted @ 2012-08-11 20:13 hebozi 阅读(138) 评论(0) 推荐(0)
 
HDU 2870 Largest Submatrix 最大完全子矩阵之不可移动列+中间元素可改变
摘要: Largest SubmatrixTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 694Accepted Submission(s): 331Problem DescriptionNow here is a matrix with letter 'a','b','c','w','x','y','z' and you can chang 阅读全文
posted @ 2012-08-11 11:16 hebozi 阅读(165) 评论(0) 推荐(0)
 
HDU 2830 Matrix Swapping II 最大完全子矩阵之可移动列
摘要: Matrix Swapping IITime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 654Accepted Submission(s): 452Problem DescriptionGiven an N * M matrix with each entry equal to 0 or 1. We can find some rectangles in the matrix whose entries are all 1, and we defi 阅读全文
posted @ 2012-08-11 09:39 hebozi 阅读(187) 评论(0) 推荐(0)