UVA 11039 - Building designing(DP)

题目链接

本质上是DP，但是俩变量就搞定了。

 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 using namespace std;
 int p[];
 bool cmp(int a,int b)
 {
     if(a < )
     a = -a;
     if(b < )
     b = -b;
     return a < b;
 }
 int main()
 {
     int t,n,p1,p2,i;
     scanf("%d",&t);
     while(t--)
     {
         scanf("%d",&n);
         for(i = ;i < n;i ++)
         {
             scanf("%d",&p[i]);
         }
         sort(p,p+n,cmp);
         p1 = p2 = ;
         for(i = ;i < n;i ++)
         {
             if(p[i] > )
             p1 = p2 + ;
             else
             p2 = p1 + ;
         }
         printf("%d\n",max(p1,p2));
     }
 }