UVa - 103 - Stacking Boxes
来源:互联网 发布:php 网站生成系统 编辑:程序博客网 时间:2024/06/02 01:03
Background
Some concepts in Mathematics and Computer Science are simple in one or two dimensions but become more complex when extended to arbitrary dimensions. Consider solving differential equations in several dimensions and analyzing the topology of an n-dimensional hypercube. The former is much more complicated than its one dimensional relative while the latter bears a remarkable resemblance to its ``lower-class'' cousin.
The Problem
Consider an n-dimensional ``box'' given by its dimensions. In two dimensions the box (2,3) might represent a box with length 2 units and width 3 units. In three dimensions the box (4,8,9) can represent a box (length, width, and height). In 6 dimensions it is, perhaps, unclear what the box (4,5,6,7,8,9) represents; but we can analyze properties of the box such as the sum of its dimensions.
In this problem you will analyze a property of a group of n-dimensional boxes. You are to determine the longest nesting string of boxes, that is a sequence of boxes such that each box nests in box ( .
A box D = ( ) nests in a box E = ( ) if there is some rearrangement of the such that when rearranged each dimension is less than the corresponding dimension in box E. This loosely corresponds to turning box D to see if it will fit in box E. However, since any rearrangement suffices, box D can be contorted, not just turned (see examples below).
For example, the box D = (2,6) nests in the box E = (7,3) since D can be rearranged as (6,2) so that each dimension is less than the corresponding dimension in E. The box D = (9,5,7,3) does NOT nest in the box E = (2,10,6,8) since no rearrangement of D results in a box that satisfies the nesting property, but F = (9,5,7,1) does nest in box E since F can be rearranged as (1,9,5,7) which nests in E.
Formally, we define nesting as follows: box D = ( ) nests in box E = ( ) if there is a permutation of such that ( ) ``fits'' in ( ) i.e., if for all .
The Input
The input consists of a series of box sequences. Each box sequence begins with a line consisting of the the number of boxes k in the sequence followed by the dimensionality of the boxes, n (on the same line.)
This line is followed by k lines, one line per box with the n measurements of each box on one line separated by one or more spaces. The line in the sequence ( ) gives the measurements for the box.
There may be several box sequences in the input file. Your program should process all of them and determine, for each sequence, which of the k boxes determine the longest nesting string and the length of that nesting string (the number of boxes in the string).
In this problem the maximum dimensionality is 10 and the minimum dimensionality is 1. The maximum number of boxes in a sequence is 30.
The Output
For each box sequence in the input file, output the length of the longest nesting string on one line followed on the next line by a list of the boxes that comprise this string in order. The ``smallest'' or ``innermost'' box of the nesting string should be listed first, the next box (if there is one) should be listed second, etc.
The boxes should be numbered according to the order in which they appeared in the input file (first box is box 1, etc.).
If there is more than one longest nesting string then any one of them can be output.
Sample Input
5 23 78 105 29 1121 188 65 2 20 1 30 1023 15 7 9 11 340 50 34 24 14 49 10 11 12 13 1431 4 18 8 27 1744 32 13 19 41 191 2 3 4 5 680 37 47 18 21 9
Sample Output
53 1 2 4 547 2 5 6
动态规划。和嵌套矩形问题本质是一样的,不过这里不需要输出字典序最小的结果。
AC代码:
#include <iostream>#include <cstdio>#include <cstdlib>#include <cctype>#include <cstring>#include <string>#include <sstream>#include <vector>#include <set>#include <map>#include <algorithm>#include <stack>#include <queue>#include <bitset> #include <cassert> #include <cmath>#include <functional>using namespace std;const int maxk = 35;int k, n, ans, target;int dp[maxk];bool first;struct Box{int dimension[12];bool operator < (const Box& rhs) const { // 方便判断是否嵌套for (int i = 0; i < n; i++) {if (dimension[i] >= rhs.dimension[i]) {return false;}}return true;}}box[maxk];void init(){memset(dp, -1, sizeof(dp));first = true;ans = -1;cin >> n;for (int i = 0; i < k; i++) {for (int j = 0; j < n; j++) {cin >> box[i].dimension[j];}sort(box[i].dimension, box[i].dimension + n);}}int dfs(int i, const vector<int> *mp){int &ans = dp[i], temp;if (ans != -1) {return ans;}ans = 1;for (int j = 0; j < mp[i].size(); j++) {temp = dfs(mp[i][j], mp) + 1;ans = max(temp, ans);}return ans;}void printAns(int i, const vector<int> *mp){if (first) {cout << i + 1;first = false;}else {cout << ' ' << i + 1;}for (int j = 0; j < mp[i].size(); j++) {if (dp[mp[i][j]] == dp[i] - 1) {printAns(mp[i][j], mp);break;}}}void solve(){vector<int> mp[maxk];for (int i = 0; i < k - 1; i++) {for (int j = i + 1; j < k; j++) {if (box[i] < box[j]) {mp[i].push_back(j);}else if (box[j] < box[i]) {mp[j].push_back(i);}}}for (int i = 0; i < k; i++) {int temp = dfs(i, mp);if (temp > ans) {ans = temp;target = i;}}cout << ans << endl;printAns(target, mp);cout << endl;}int main(){ios::sync_with_stdio(false);while (cin >> k) {init();solve();}return 0;}
- UVa 103 Stacking Boxes
- UVA 103 - Stacking Boxes
- uva 103 - Stacking Boxes
- uva 103 Stacking Boxes
- [UVA 103] Stacking Boxes
- uva:103 - Stacking Boxes
- UVa 103 - Stacking Boxes
- UVA - 103 Stacking Boxes
- uva 103 - Stacking Boxes
- UVA 103 Stacking Boxes
- UVa 103 - Stacking Boxes
- Uva - 103 - Stacking Boxes
- uva 103 - Stacking Boxes
- UVa 103 - Stacking Boxes
- UVa 103 - Stacking Boxes
- Uva-103-Stacking Boxes
- UVa:103 Stacking Boxes
- UVA - 103 Stacking Boxes
- mysql登录报错 ERROR 1045 (28000)
- 桥接模式
- codeforces #311 557D D. Vitaly and Cycle (dfs+图论判断判断构造奇环)
- mysql读写分离(主从复制)实现
- java 基础知识随笔
- UVa - 103 - Stacking Boxes
- 什么是硬件以及什么是软件
- Eclipse快捷键大全
- SHINE OPENCART 自适应 多用途主题模板 ABC-0021
- 2014成都百万职工职业技能大赛计算机程序员决赛 技能大赛决赛题目
- 判断主机是否支持远程开机?
- 需求文档的类别及适用情况
- LocalBroadcastManager原理和机制
- makefile中$0,$n,$*,$#等