线段覆盖2（动态规划）

http://wikioi.com/problem/3027/

#include<iostrhttp://wikioi.com/problem/3027/eam>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<iomanip>

using namespace std;
#define maxn 1005 
int dp[ maxn ] ;
struct node
{
	int left , right , value ;
}edge[ maxn ] ;

int cmp( const node a , const node b )
{
	return a.right < b.right ;
}

int main()
{
	int n ;
	scanf( "%d" , &n ) ;
	{
		for( int i = 0 ; i < n ; ++i )
		{
			scanf( "%d%d%d" , &edge[ i ].left , &edge[ i ].right , &edge[ i ].value ) ;
		}
		sort( edge , edge + n , cmp ) ;
		for( int i = 1 ; i < n; ++i )
		{
			int k = 0 ;
			for