Stacking Boxes
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld
& %llu
Submit Status Practice UVA
103
Appoint description:
System Crawler (2015-07-19)
Description
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 2 3 7 8 10 5 2 9 11 21 18 8 6 5 2 20 1 30 10 23 15 7 9 11 3 40 50 34 24 14 4 9 10 11 12 13 14 31 4 18 8 27 17 44 32 13 19 41 19 1 2 3 4 5 6 80 37 47 18 21 9
Sample Output
5 3 1 2 4 5 4 7 2 5 6
多边形嵌套 不过除了要求输出最多嵌套多少个之外 还要输出嵌套的是哪一个多边形 LIS输出路径也就是
就是LIS 用一个是s数组来存放上升子序列的上一个 最后用递归 逆序输出
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 55;
int dp[maxn], s[maxn];
struct Node{
int index;
int an[12];
}arr[maxn];
int n, k;
bool cmp(Node c, Node d);
bool judge(int i, int j);
void dfs(int i);
int main(){
while(scanf("%d%d", &k, &n) != EOF){
for(int i = 0; i < k; ++i){
for(int j = 0; j < n; ++j){
scanf("%d", &arr[i].an[j]);
}
arr[i].index = i+1;
sort(arr[i].an, arr[i].an+n);
dp[i] = 1;
s[i] = 1;
}
sort(arr, arr+k, cmp);
s[0] = 0;
int ans = 1;
int pos = 0;
for(int i = 1; i < k; ++i){
for(int j = 0; j < i; ++j){
if(judge(j, i) && dp[i] < dp[j] + 1){
dp[i] = dp[j] + 1;
s[i] = j;
}
}
if(ans < dp[i]){
ans = dp[i];
pos = i;
}
}
printf("%d\n", ans);
dfs(pos);
puts("");
}
return 0;
}
bool cmp(Node c, Node d){
for(int i = 0; i < n; ++i){
if(c.an[i] > d.an[i]){
return false;
}
}
return true;
}
bool judge(int i, int j){
for(int t = 0; t < n; ++t){
if(arr[i].an[t] >= arr[j].an[t]){
return false;
}
}
return true;
}
void dfs(int i){
if(s[i] != i){
dfs(s[i]);
}
printf("%d ", arr[i].index);
}
版权声明：本文为博主原创文章，未经博主允许不得转载。