//http://acm.
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
int main()
{
    int n,max,i;
    int maxlen[10010];
    cin>>n;
    string a;
    while (n--)
    {
        memset(maxlen,0,sizeof(maxlen));
        maxlen[0]=1;
        cin>>a;
        for (i=1;i<a.size();i++){
            int tmp=0;
            for (int j=0;j<i;j++){
                if (a[j] < a[i]){
                    if (tmp < maxlen[j]){
                        tmp = maxlen[j];
                    }
                  //  maxlen[i]=tmp+1;
                }
            }
                  maxlen[i]=tmp+1;
        }
        max=0;
        for(i=0;i<a.size();i++)
            if(max<maxlen[i])
                max=maxlen[i];
        cout<<max<<endl;
    }
    return 0;
}

[ 本帖最后由 love24114 于 2012-1-29 09:14 编辑 ]