[平面几何][思维]Kadj Squares POJ3347

In this problem, you are given a sequence S1, S2, ..., Sn of squares of different sizes. The sides of the squares are integer numbers. We locate the squares on the positive x-y quarter of the plane, such that their sides make 45 degrees with x and y axes, and one of their vertices are on y=0 line. Let bi be the x coordinates of the bottom vertex of Si. First, put S1 such that its left vertex lies on x=0. Then, put S1, (i > 1) at minimum bi such that

• bi > bi-1 and
• the interior of Si does not have intersection with the interior of S1...Si-1.

The goal is to find which squares are visible, either entirely or partially, when viewed from above. In the example above, the squares S1, S2, and S4 have this property. More formally, Si is visible from above if it contains a point p, such that no square other than Si intersect the vertical half-line drawn from p upwards.

Input

The input consists of multiple test cases. The first line of each test case is n (1 ≤ n ≤ 50), the number of squares. The second line contains n integers between 1 to 30, where the ith number is the length of the sides of Si. The input is terminated by a line containing a zero number.

Output

For each test case, output a single line containing the index of the visible squares in the input sequence, in ascending order, separated by blank characters.

Sample Input

4
3 5 1 4
3
2 1 2
0

Sample Output

1 2 4
1 3

题意： 给出n个正方形的边长，按给出顺序以旋转45°的形式排放在坐标轴上，并且要求尽可能紧凑，如上图所示。询问最终从上方能看到的正方形编号。

分析： 细节题。对于每个正方形边长可以乘根号2，这样可以避免接下来出现浮点数。按顺序枚举每一个正方形，若当前正方形边长a[i]小于上一个正方形边长a[i-1]，那么这个正方形的位置x[i] = x[i-1] + 2*a[i]，2*a[i]是乘根2后的对角线长度，若a[i] >= a[i-1]且a[i] <= 2*a[i-1]，此时当前的正方形还是可以和上一个正方形贴着的，其位置x[i] = x[i-1] + 2*a[i-1]，2*a[i-1]是上一个正方形对角线长度，最后一种情况a[i] > 2*a[i-1]，这时候正方形位置并不确定，我们可以枚举之前所有的正方形，假设它是跟当前正方形挨着，计算得出可能的横坐标t，对于所有的t取一个最大值就是当前正方形的坐标，因为当前这个正方形一定会挨着前i-1个正方形中的某一个，如果取了非最大的坐标那么就会和最大的坐标产生冲突，所以一定要选横坐标最大的点。

确定了每个正方形的坐标后它们各自能伸展的区间也确定了，l[i] = x[i]-a[i]，r[i] = x[i]+a[i]，得到区间后可以用类似染色的方法刷数组，遍历每个正方形的l~r一遍，如果当前位置的grade小于这个正方形的grade就覆盖掉这个位置，grade也就是正方形的边长，同时每个正方形的区间长度还需要扩大两倍，防止刷数组时出现某个颜色被挤掉的情况，例如给出三个边长为2，1，1的正方形，它们覆盖的区间分别为[0, 4], [3, 5], [5, 7]，中间的正方形被遮挡住了，实际上是不会被遮住的。

染完色后再扫一遍数组输出一次不同的颜色即可。

具体代码如下：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

int a[55], x[55], l[55], r[55];
struct node
{
	int color;
	int grade;
}node[100005];
bool vis[55];

signed main()
{
	int n;
	while(~scanf("%d", &n))
	{
		if(n == 0)
			break;
		for(int i = 1; i <= n; i++)//小技巧，边长都乘根2 
		{
			scanf("%d", &a[i]);
			vis[i] = x[i] = l[i] = r[i] = 0;
		}
		for(int i = 0; i <= 10000; i++)
			node[i].color = node[i].grade = 0;
		x[1] = a[1];
		l[1] = 0;
		r[1] = 2*a[1];
		for(int i = 2; i <= n; i++)
		{
			if(a[i] < a[i-1])
				x[i] = x[i-1]+2*a[i];
			else if(a[i] >= a[i-1] && a[i] <= 2*a[i-1])
				x[i] = x[i-1]+2*a[i-1];
			else
			{
				for(int j = 1; j <= i-1; j++)//现在不确定挨着哪个正方形，需要枚举出来
				{
					if(a[i] < a[j])
						x[i] = max(x[i], x[j]+2*a[i]);
					else
						x[i] = max(x[i], x[j]+2*a[j]);
				} 
			}
			l[i] = x[i]-a[i], r[i] = x[i]+a[i];
		}
		for(int i = 1; i <= n; i++)
		{
			for(int j = 2*l[i]; j <= 2*r[i]; j++)//区间扩大一倍 
			{
				if(a[i] >= node[j].grade)
				{
					node[j].color = i;
					node[j].grade = a[i];
				}
			}
		}
		for(int i = 0; i <= 10000; i++)
		{
			if(!vis[node[i].color] && node[i].color)
			{
				vis[node[i].color] = true;
				printf("%d ", node[i].color);
			}
		}
		puts("");
		
	}
    return 0;
}