An easy DP problem HDOJ 1176

An easy DP problem - HDOJ 1176
极光炫影 发表于 2005-12-22 15:03:44
#include<stdio.h>
#include<algorithm>
using namespace std;
 
struct DATA
{
       int x, t;
};
 
DATA data[100000];
int stateold[11], statenew[11], cost[11];
 
bool cmp(const DATA&a, const DATA&b)
{
       if(a.t != b.t) return a.t < b.t;
       else return a.x < b.x;
}
 
inline int maxv(int a, int b)
{
       return a > b ? a : b;
}
 
inline int minv(int a, int b)
{
       return a < b ? a : b;
}
 
int main()
{
       int n, i, j, k, v, l, h, t;
       while(scanf("%d", &n) == 1 && n)
       {
              for(i = 0; i < n; ++i)
              {
                     scanf("%d%d", &data[i].x, &data[i].t);
              }
              memset(statenew, -1, sizeof(statenew));
              sort(data, data + n, cmp);
              statenew[5] = 0;
              t = 0;
              for(i = 0; i < n; ++i)
              {
                     for(j = 0; j < 11; ++j) cost[j] = 0;
                     for(j = i; j < n && data[j].t == data[i].t; ++j) cost[data[j].x]++;
                     i = j - 1;
                     for(j = 0; j < 11; ++j) stateold[j] = statenew[j];
                     for(j = 0; j <= 10; ++j)
                     {
                            l = maxv(0, j + t - data[i].t);
                            h = minv(10, j + data[i].t - t);
                            v = stateold[l];
                            for(k = l + 1; k <= h; ++k)
                            {
                                   v = maxv(v, stateold[k]);
                            }
                            if(v >= 0) statenew[j] = v + cost[j];
                            else statenew[j] = -1;
                     }
                     t = data[i].t;
              }
              v = 0;
              for(i = 0; i < 11; ++i)
                     if(v < statenew[i])
                            v = statenew[i];
              printf("%d/n", v);
       }
       return 0;
}