hdoj5092Seam Carving【dp】
来源:互联网 发布:php工程师招聘 编辑:程序博客网 时间:2024/06/06 11:49
Seam Carving
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1043 Accepted Submission(s): 422
Problem Description
Fish likes to take photo with his friends. Several days ago, he found that some pictures of him were damaged. The trouble is that there are some seams across the pictures. So he tried to repair these pictures. He scanned these pictures and stored them in his computer. He knew it is an effective way to carve the seams of the images He only knew that there is optical energy in every pixel. He learns the following principle of seam carving. Here seam carving refers to delete through horizontal or vertical line of pixels across the whole image to achieve image scaling effect. In order to maintain the characteristics of the image pixels to delete the importance of the image lines must be weakest. The importance of the pixel lines is determined in accordance with the type of scene images of different energy content. That is, the place with the more energy and the richer texture of the image should be retained. So the horizontal and vertical lines having the lowest energy are the object of inspection. By constantly deleting the low-energy line it can repair the image as the original scene.
For an original image G of m*n, where m and n are the row and column of the image respectively. Fish obtained the corresponding energy matrix A. He knew every time a seam with the lowest energy should be carved. That is, the line with the lowest sum of energy passing through the pixels along the line, which is a 8-connected path vertically or horizontally.
Here your task is to carve a pixel from the first row to the final row along the seam. We call such seam a vertical seam.
For an original image G of m*n, where m and n are the row and column of the image respectively. Fish obtained the corresponding energy matrix A. He knew every time a seam with the lowest energy should be carved. That is, the line with the lowest sum of energy passing through the pixels along the line, which is a 8-connected path vertically or horizontally.
Here your task is to carve a pixel from the first row to the final row along the seam. We call such seam a vertical seam.
Input
There several test cases. The first line of the input is an integer T, which is the number of test cases, 0<T<=30. Each case begins with two integers m, n, which are the row and column of the energy matrix of an image, (0<m,n<=100). Then on the next m line, there n integers.
Output
For each test case, print “Case #” on the first line, where # is the order number of the test case (starting with 1). Then print the column numbers of the energy matrix from the top to the bottom on the second line. If there are more than one such seams, just print the column number of the rightmost seam.
Sample Input
24 355 32 7517 69 7354 81 6347 5 456 651 57 49 65 50 7433 16 62 68 48 612 49 76 33 32 7823 68 62 37 69 3968 59 77 77 96 5931 88 63 79 32 34
Sample Output
Case 12 1 1 2Case 23 2 1 1 2 1
#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#define inf 0x3f3f3f3fusing namespace std;const int maxn=110;int n,m;int map[maxn][maxn];void print(int pos,int k){if(k==0){printf("%d ",pos);return ;}if(map[k][pos-1]<map[k][pos]&&map[k][pos-1]<map[k][pos+1]){print(pos-1,k-1);}else if(map[k][pos]<=map[k][pos-1]&&map[k][pos]<map[k][pos+1]){print(pos,k-1);}else if(map[k][pos+1]<=map[k][pos]&&map[k][pos+1]<=map[k][pos-1]){print(pos+1,k-1);}if(k==n-1){printf("%d\n",pos);}else {printf("%d ",pos);}}int main(){int i,j,t,k=1;scanf("%d",&t);while(t--){scanf("%d%d",&n,&m);memset(map,0x3f,sizeof(map));for(i=1;i<=n;++i){for(j=1;j<=m;++j){scanf("%d",&map[i][j]);}}int ans=inf,pos;for(i=2;i<=n;++i){for(j=1;j<=m;++j){map[i][j]+=min(map[i-1][j-1],min(map[i-1][j],map[i-1][j+1]));if(i==n){if(map[i][j]<=ans){ans=map[i][j];pos=j;}}}}printf("Case %d\n",k++);print(pos,n-1);}return 0;}
0 0
- hdoj5092Seam Carving【dp】
- 【DP】 HDU 5092 Seam Carving
- HDOJ 5092 Seam Carving DP
- hdu 5092 Seam Carving(dp)
- HDU 5092 Seam Carving DP
- hdu5092 Seam Carving(dp 打印路径)
- Hdu 5092 Seam Carving(dp)
- HDU 5092 Seam Carving(DP, 路径)
- HDU 5092 Seam Carving(DP)
- hdu 5092 Seam Carving dp+记录路径
- hdu 5092 Seam Carving(DP+记录路径)
- HDU 5092 Seam Carving(上海邀请赛基础DP)
- 2014年上海邀请赛C Seam Carving(二维dp)
- HDU 5092 Seam Carving (DP+打印路径)
- HDU5092 Seam Carving(2014上海全国邀请赛——题目重现)(DP)
- hdoj 5092 Seam Carving 【树塔DP变形 + 路径输出】 【简单题】
- Seam Carving
- HDU5092 Seam Carving
- 黑马程序员-@protocol协议代理与block代码块
- centos7下使用yum安装mysql
- 客厅智能化(3、4)
- 关于我过去的一年
- linux input子系统驱动(二)
- hdoj5092Seam Carving【dp】
- 关于Pascal和二项式系数
- debian 安装博通无线网卡驱动
- 安全
- 给你n个整数,求他们中所有奇数的乘积。
- 不同OS和不同编译器的条件编译小结
- linux安装qq
- iOS 【UIKit-事件产生与传送 练习(重写hitTest和pointInside方法)】
- 基于C++及三维设计平台的开发