POJ - 1083 Moving Tables

点击打开链接

一开始把问题想得太复杂了……

//poj 1083
//  [6/11/2014 wind]
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAX_N = 200;
int n;
int cdr1[MAX_N], cdr2[MAX_N];
int cnt[MAX_N];

void solve()
{
	memset ( cnt, 0, sizeof ( cnt ) );
	for ( int i = 0; i < n; i++ )
	{
		for ( int j = cdr1[i]; j <= cdr2[i]; j++ )
		{
			cnt[j]++;
		}
	}
	int Max = 0;
	for ( int i = 0; i < MAX_N; i++ )
	{
		Max = max ( Max, cnt[i] );
	}
	printf ( "%d\n", 10 * Max );
}

int main()
{
	//freopen ( "in.txt", "r", stdin );
	int t = 0;
	scanf ( "%d", &t );
	while ( t-- )
	{
		scanf ( "%d", &n );
		for ( int i = 0; i < n; i++ )
		{
			int r1, r2;
			scanf ( "%d%d", &r1, &r2 );
			//corridor num: range [0, 200)
			cdr1[i] = ( r1 - 1 ) / 2;
			cdr2[i] = ( r2 - 1 ) / 2;
			if ( cdr1[i] > cdr2[i] )
				swap ( cdr1[i], cdr2[i] );
		}

		solve();
	}
}

题意：