uva116

来源：互联网发布：java log4j maven 编辑：程序博客网时间：2024/05/19 03:43

题意:

从左往右走,使得得到的行数的字典集尽量小,且得到的总和最小

思路:

逆向dp保证字典集尽量小

if中两个=是保证字典集最小

代码:

#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>using namespace std;int m, n;int maps[11][101];int smap[11][101];int fath[11][101];int main() {while(scanf("%d%d", &n, &m) != EOF) {for(int i=1; i<=n; i++)for(int j=1; j<=m; j++) scanf("%d", &maps[i][j]);memset(smap, 0, sizeof(smap));for(int i=m; i>=1; i--)for(int j=1; j<=n; j++) {smap[j][i] = smap[j][i+1]+maps[j][i];//往前直走fath[j][i] = j;         if (j > 1 && smap[j][i] >= smap[j-1][i+1]+maps[j][i]) {                  smap[j][i] = smap[j-1][i+1]+maps[j][i];                  fath[j][i] = j-1;              }             if (j < n && smap[j][i] > smap[j+1][i+1]+maps[j][i]) {                  smap[j][i] = smap[j+1][i+1]+maps[j][i];                  fath[j][i] = j+1;              } if(j==1 && smap[j][i]>smap[n][i+1]+maps[j][i]) {fath[j][i] = n;smap[j][i] = smap[n][i+1]+maps[j][i];}            if (j == n && smap[j][i] >= smap[1][i+1]+maps[j][i]) {                  smap[j][i] = smap[1][i+1]+maps[j][i];                  fath[j][i] = 1;              }                }          int spa = 1;for(int i=2; i<=n; i++)if(smap[spa][1]>smap[i][1]) {//找到最小的起点 spa = i;}int minx = smap[spa][1];for(int i=1; i<=m; i++) {if(i<m) printf("%d ", spa);else printf("%d\n%d\n", spa, minx);spa = fath[spa][i];}}return 0;}

0 0