UVa 116 Unidirectional TSP
2016-07-08 21:17
330 查看
逆向dp,保证字典序最小。
借鉴了小白菜又菜大神的码……
抽空再把书上的敲一遍。嗯……
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
using namespace std;
int maps[11][101];
int dp[11][101];
int fath[11][101];
int main() {
int n,m;
while (~scanf ("%d%d",&n,&m) ) {
for (int i = 1 ; i <= n ; ++ i)
for (int j = 1 ; j <= m ; ++ j) {
scanf ("%d",&maps[i][j]);
}
memset (dp, 0, sizeof (dp) );
for (int i = m ; i >= 1 ; -- i)
for (int j = 1 ; j <= n ; ++ j) {
dp[j][i] = dp[j][i+1]+maps[j][i];
fath[j][i] = j;
if (j > 1 && dp[j][i] >= dp[j-1][i+1]+maps[j][i]) {
dp[j][i] = dp[j-1][i+1]+maps[j][i];
fath[j][i] = j-1;
}
if (j == n && dp[j][i] >= dp[1][i+1]+maps[j][i]) {
dp[j][i] = dp[1][i+1]+maps[j][i];
fath[j][i] = 1;
}
if (j < n && dp[j][i] > dp[j+1][i+1]+maps[j][i]) {
fath[j][i] = j+1;
dp[j][i] = dp[j+1][i+1]+maps[j][i];
}
if (j == 1 && dp[j][i] > dp
[i+1]+maps[j][i]) {
dp[j][i] = dp
[i+1]+maps[j][i];
fath[j][i] = n;
}
}
int spa = 1;
for (int i = 2 ; i <= n ; ++ i)
if (dp[spa][1] > dp[i][1]) {
spa = i;
}
int minn = dp[spa][1];
for (int i = 1 ; i <= m ; ++ i) {
if (i < m) { printf ("%d ",spa); }
else { printf ("%d\n%d\n",spa,minn); }
spa = fath[spa][i];
}
}
return 0;
}
借鉴了小白菜又菜大神的码……
抽空再把书上的敲一遍。嗯……
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
using namespace std;
int maps[11][101];
int dp[11][101];
int fath[11][101];
int main() {
int n,m;
while (~scanf ("%d%d",&n,&m) ) {
for (int i = 1 ; i <= n ; ++ i)
for (int j = 1 ; j <= m ; ++ j) {
scanf ("%d",&maps[i][j]);
}
memset (dp, 0, sizeof (dp) );
for (int i = m ; i >= 1 ; -- i)
for (int j = 1 ; j <= n ; ++ j) {
dp[j][i] = dp[j][i+1]+maps[j][i];
fath[j][i] = j;
if (j > 1 && dp[j][i] >= dp[j-1][i+1]+maps[j][i]) {
dp[j][i] = dp[j-1][i+1]+maps[j][i];
fath[j][i] = j-1;
}
if (j == n && dp[j][i] >= dp[1][i+1]+maps[j][i]) {
dp[j][i] = dp[1][i+1]+maps[j][i];
fath[j][i] = 1;
}
if (j < n && dp[j][i] > dp[j+1][i+1]+maps[j][i]) {
fath[j][i] = j+1;
dp[j][i] = dp[j+1][i+1]+maps[j][i];
}
if (j == 1 && dp[j][i] > dp
[i+1]+maps[j][i]) {
dp[j][i] = dp
[i+1]+maps[j][i];
fath[j][i] = n;
}
}
int spa = 1;
for (int i = 2 ; i <= n ; ++ i)
if (dp[spa][1] > dp[i][1]) {
spa = i;
}
int minn = dp[spa][1];
for (int i = 1 ; i <= m ; ++ i) {
if (i < m) { printf ("%d ",spa); }
else { printf ("%d\n%d\n",spa,minn); }
spa = fath[spa][i];
}
}
return 0;
}
相关文章推荐
- python读取excel文件—xlrd
- 单链表常见操作
- sql:除非另外还指定了 TOP 或 FOR XML,否则,ORDER BY 子句在视图、内联函数、派生表、子查询
- day06_反射02
- fifo.c
- 【Hibernate 3】一对一映射配置
- 声音
- php中将12567890装化为1,234,567,890
- springMVC 含时间类型的数据处理 405 错误
- fifo.h
- 【Hibernate 3】一对一映射配置
- 动态树分治
- 将一个字符串(1234567890)转换成(1,234,567,890)每三个一组用逗号隔开
- 利用Struts2和Hibernate实现页面分页显示的功能
- Codeforces Round #323 (Div. 2) C gcd
- 安卓--ListView和Adapter的关系和如何使用实例
- C#泛型编程
- OpenCV Transparent API
- UVALive 7040 Color (容斥原理+逆元+组合数+费马小定理+快速幂)
- HDU-1561 The more, The Better(依赖背包)