蓝桥杯-本质上升序列

#include<bits/stdc++.h>
using namespace std;
int main()
{
    string A="tocyjkdzcieoiodfpbgcncsrjbhmugdnojjddhllnofawllbhfiadgdcdjstemphmnjihecoapdjjrprrqnhgccevdarufmliqijgihhfgdcmxvicfauachlifhafpdccfseflcdgjncadfclvfmadvrnaaahahndsikzssoywakgnfjjaihtniptwoulxbaeqkqhfwl";
    long long int aa[100000]={0};

    for(int i=0;i<A.length();i++)
    {
        aa[i]=1;
    }

    for(int i=0;i<A.length();i++)
    {
        for(int j=0;j<i;j++)
        {
            if(A[i]>A[j])aa[i]+=aa[j];
            if(A[j]==A[i])aa[i]-=aa[j];
        }
    }
    int sum=0;
    for(int i=0;i<A.length();i++)
    {
        sum += aa[i];
    }
    cout << sum << endl;
    return 0;
}