单调递增最长子序列 南工17

和拦截导弹一样的题

#include <iostream>
#include <cstdio>
#include <string.h>
using namespace std;
# include <cstring>
int res[10001];
char s[10001];
int main()
{
    int n, i, j, len, max;
    char c;
 //   freopen("in.txt", "r", stdin);
    scanf("%d", &n);
    while (n--)
    {
        memset(res, 0, sizeof(res));
        scanf("%s", s);
        len=strlen(s);
        for (i = 0; i<len; i++)
        {
            if (i==0)
            {res[i]=1;continue;}
            max = 0;
            for (j = 0; j<i; j++)
            {
                if (s[i]>s[j]&&max<=res[j])
                    max=res[j];
            }
            res[i]=max+1;
        }
        max = 0;
        for(i = 0; i<len; i++)
        {
            if (max<res[i])
                max=res[i];
        }
        printf("%d\n", max);
    }
    return 0;
}