ACdream: ACfun，acdreamacfun

ACdream: ACfun，acdreamacfun

ACfun


Time Limit: 2000/1000MS (Java/Others)Memory Limit: 128000/64000KB (Java/Others)SubmitStatisticNext ProblemProblem DescriptionAs a former ACMer, "AC" is a special abbreviated word which can bring much pleasure to me. Sometimes it means everything.
This problem is about "AC".
One day, I write a long string S on the paper which contains "A" and "C". Now I want to find a lexicographic minimum string T satisfied that T is distinct with all substring of S.InputThe first line of input file contains an integer T indicating the number of case.
In each test case:
Input a string S consist of "A" and "C". The length of S is not large than 100.OutputFor each test case:
You should output the string T meet the condition.Sample Input

1ACAC

Sample Output

AA

題意是要輸出最小的字典序，且不是原字串的的子串。。找到最長連續A子串。。因為要不屬於原字串所以再在其後加一A即可。

在給些資料吧。

5

A

C

AACAAA

ACACA

CCCAA

AA

A

AAAA

AA

AAA

#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>#include<vector>#include<queue>using namespace std;int main(){    char str[108];    int ans;    int t;    scanf("%d", &t);    while( t-- )    {        scanf("%s", str);        int num=0;        ans=0;        for(int i=0; i<strlen(str); i++)        {            if(str[i]=='A')                    num++;            for(int j=i+1; j<strlen(str); j++)            {                if(str[j]=='A')                    num++;                if(str[j]!='A')                    break;            }            if(ans<num)               ans=num;            num=0;        }        for(int i=1; i<=ans+1; i++)            cout<<"A";        cout<<endl;    }    return 0;}

ACFUN 網站的彈幕視頻下載方法

視頻字幕內嵌可以看 acfun.chunqing286.com/...%8d%97 中的4.5節關於壓制的部分，推薦用的軟體是megui
 
怎使用acfun下載bilibili視頻

acfunlocalizer同樣支援bilibili

直接複製視頻頁面地址然後在程式介面中按“添加”按鈕就可以了。。。
更進階的一些用法可以參見：
acfun.chunqing286.com/...%8d%97