hlg_oj_1116_选美大赛

这题是最长子序列，然后再求出路径就可以了。开始写的比较乱，用数组什么的，后来用了指针就好办了。现在把代码贴出来。指针真的挺给力的。

--------------------------------------------------------------------------------------------------------------------

#include <iostream>
#include <stack>
#include <cmath>
using namespace std;
struct people
{
    int num,h;
    people* last;
}girl[100+5];
int main()
{
    int n;
    int i,j;
    int dp[100+10];
    stack<int>haha;
    while(cin>>n&&n)
    {
     for(i=1;i<=n;++i)
      dp[i]=1;
     for(i=1;i<=n;++i)
     {
      cin>>girl[i].h;
      girl[i].num=i;
      girl[i].last=NULL;
     }
     for(i=1;i<=n;++i)
     {
         for(j=1;j<i;++j)
         {
             if(girl[i].h>girl[j].h) 
             {
                 if(dp[j]+1>dp[i]) 
                 {
                     dp[i]=dp[j]+1;
                     girl[i].last=&girl[j];

                 }
             }
         }
     }
     int max=0,maxsign=0;
     for(i=1;i<=n;++i)
     {
         if(dp[i]>max){ max=dp[i];maxsign=i;}
     }
     cout<<"The number is ";
     cout<<max;
     cout<<":";
     haha.push(girl[maxsign].num);
     people* temple=girl[maxsign].last;
     while(temple)
     {
            haha.push(temple->num); 
            temple=temple->last;
     }
     while(haha.size()>0)
     {     
         cout<<" "<<haha.top();haha.pop();}
         cout<<endl;
    }
    return 0;
}