poj 1083 DP

AC代码如下：

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

int main(){
	int dp[210];
	int N, T, ans;

	cin >> T;
	while( T-- ){
		cin >> N;
		memset( dp, 0, sizeof( dp ) );
		for( int i = 0; i < N; i++ ){
			int temp1, temp2;
			scanf( "%d%d", &temp1, &temp2 );
			temp1 = ( temp1 - 1 ) / 2;
			temp2 = ( temp2 - 1 ) / 2;
			if( temp1 > temp2 ){
				swap( temp1, temp2 );
			}
			for( int j = temp1; j <= temp2; j++ ){
				dp[j] += 10;
			}
		}
		ans = 0;
		for( int i = 0; i < 200; i++ ){
			ans = max( ans, dp[i] );
		}
		cout << ans << endl;
	}
	return 0;
}