1629 - Cake slicing
来源:互联网 发布:驾驶远程教育及时软件 编辑:程序博客网 时间:2024/05/20 04:26
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=848&problem=4504&mosmsg=Submission+received+with+ID+16048725
我有话说:
这道题的大致思想是动态规划中的记忆化搜索。求对于给定区域(r1,c1,r2,c2)达到题目目标的最少的切割线总长度。一步一步划分下去。最后得到答案。注意数组dp不宜过大。
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <vector>#include <queue>using namespace std;const int maxn=100;const int INF=0x3f3f3f3f;int n,m,k;int G[maxn][maxn];int dp[maxn][maxn][maxn][maxn];void Init(){ for(int i=2;i<=n;i++){ for(int j=1;j<=m;j++){ G[i][j]+=G[i-1][j]; } } for(int j=2;j<=m;j++){ for(int i=1;i<=n;i++){ G[i][j]+=G[i][j-1]; } }}int count_num(int r1,int c1,int r2,int c2){ return G[r2][c2]-G[r2][c1-1]-G[r1-1][c2]+G[r1-1][c1-1];//区域内的樱桃数量}int solve(int r1,int c1,int r2,int c2){ int& ans=dp[r1][c1][r2][c2]; if(ans!=INF)return ans; if(count_num(r1,c1,r2,c2)==1)return ans=0; for(int i=r1;i<r2;i++){ int num1=count_num(r1,c1,i,c2); int num2=count_num(i+1,c1,r2,c2);//横切 if(num1==0||num2==0)continue; ans=min(ans,solve(r1,c1,i,c2)+solve(i+1,c1,r2,c2)+c2-c1+1); } for(int i=c1;i<c2;i++){ int num1=count_num(r1,c1,r2,i); int num2=count_num(r1,i+1,r2,c2);//竖切 if(num1==0||num2==0)continue; ans=min(ans,solve(r1,c1,r2,i)+solve(r1,i+1,r2,c2)+r2-r1+1); } return ans;}int main(){ int kase=0; while(scanf("%d%d%d",&n,&m,&k)==3){ if(k == 0) { printf("Case %d: %d\n", kase++, 0); } memset(G,0,sizeof(G)); int x,y; for(int i=0;i<k;i++){ scanf("%d%d",&x,&y); G[x][y]=1; } memset(dp,INF,sizeof(dp)); Init(); printf("Case %d: %d\n",++kase,solve(1,1,n,m)); } return 0;}
0 0
- UVa 1629 - Cake slicing
- 1629 - Cake slicing
- UVA 1629 Cake slicing
- 1629 - Cake slicing(DP)
- UVA 1629 - Cake slicing 题解
- UVa 1629 Cake Slicing DP
- uva - 1629 Cake slicing(dp)
- uva 1629 cake slicing(dp)
- Uva-1629 Cake slicing(DP)
- UVa #1629 Cake slicing (习题9-3)
- [UVA 1629]Cake slicing[记忆化搜索]
- [DP枚举]UVa 1629 - Cake slicing
- uva 1629——Cake slicing
- UVa 1629 Cake Slicing (切蛋糕)
- UVA1629---Cake slicing
- Uva1629:Cake slicing
- UVa1629 Cake Slicing
- Cake slicing UVA
- 变位词 — 两种算法实现
- JSP Custom tags with example – JSP Tutorial
- leetcode 191 Number of 1 Bits(难易度:Easy)
- 20150607的总结--纪念高考
- 剪花布条
- 1629 - Cake slicing
- 如何将编辑好的TXT转换为PDF文件
- 链表的经典技巧及算法
- centOS 源的更新
- C++多线程编程入门(转)
- Javascript:谈谈JS的全局变量跟局部变量
- SolrCloud功能和架构 SolrCloud Features and Architecture
- 接口和抽象类
- Undefined symbols for architecture x86_64/armv7 解决方法