单调递增最长子序列

3
aaa
ababc
abklmncdefg

1
3
7

 
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <list>
#include <memory.h>
#include <string>
#include <math.h>
using namespace std;
char ch[10005];
int dis[10005];
int main()
{
    int n;
    cin>>n;
    while(n--)
    {
        cin>>ch;
        dis[0] = 1;
        int max_ = 1;
        for(int i=0;i<strlen(ch);i++)
        {
            dis[i] = 1;
            for(int j=0;j<i;j++)
            {
                if(ch[j] < ch[i])
                    dis[i] = max(dis[i],dis[j]+1);
                if(dis[i] >= max_)
                    max_ = dis[i];
            }
        }
        
        cout<<max_<<endl;
    }

     return 0;

}