最长上升子序列的变形

poj  3616

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
typedef struct 
{
  int s, e, v;
}point;
point a[1010];
int dp[1010], n, m, r;
bool cmp(point a, point b)
{
  return a.e < b.e;
}
int main()
{
  while(scanf("%d %d %d", &n, &m, &r) == 3)
    {
       int ans = -1;
       memset(dp, 0, sizeof(dp));
       for(int i=1; i<=m; i++)
       	 scanf("%d %d %d", &a[i].s, &a[i].e, &a[i].v);
       sort(a+1, a+m+1, cmp);
       for(int i=1; i<=m; i++)
         {
         	dp[i] = a[i].v;
         	for(int j=1; j<i; j++)
         	  if(a[j].e+r <= a[i].s)
         	  	dp[i] = max(dp[i], dp[j]+a[i].v);
         	ans = max(ans, dp[i]);
         }
       printf("%d\n", ans);
    }
   return 0;
}

hdu 1069

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

typedef struct
{
  int x, y, z;
}point1;
point1 a[40];
typedef struct
{
  int b, h, x, y;
}point2;
point2 c[100];
int n, dp[100], ca = 1;
bool cmp(point2 x, point2 y)
{
  return x.b > y.b;
}
int main()
{
  while(scanf("%d", &n), n)
   {
   	 int ans = -1;
   	 memset(dp, 0, sizeof(dp));
   	 for(int i=1; i<=n; i++)
   	 	scanf("%d %d %d", &a[i].x, &a[i].y, &a[i].z);
   	 int k = 0;
   	 for(int i=1; i<=n; i++)
   	   {
   	   	 c[++k].b = a[i].x*a[i].y, c[k].h = a[i].z;
   	   	 c[k].x = min(a[i].x, a[i].y);
   	   	 c[k].y = max(a[i].x, a[i].y);
   	   	 c[++k].b = a[i].x*a[i].z, c[k].h = a[i].y;
   	   	 c[k].x = min(a[i].x, a[i].z);
   	   	 c[k].y = max(a[i].x, a[i].z);
   	   	 c[++k].b = a[i].y*a[i].z, c[k].h = a[i].x;
   	   	 c[k].x = min(a[i].y, a[i].z);
   	   	 c[k].y = max(a[i].y, a[i].z);
   	   }
   	 sort(c+1, c+k+1, cmp);
   	 for(int i=1; i<=k; i++)
   	   {
   	     dp[i] = c[i].h;
   	     for(int j=1; j<i; j++)
   	       if(c[i].x<c[j].x && c[i].y<c[j].y)
   	       	 dp[i] = max(dp[i], dp[j] + c[i].h);
   	     ans = max(ans, dp[i]);
   	   }
   	 printf("Case %d: maximum height = %d\n", ca++, ans);
   }
  return 0;
}