字符串_堆栈_备份数组_1915_D. Unnatural Language Processing
#includeusingnamespacestd;constintN=2e5+10;charbackups[N];chars[N];voidsolve(){intn;cin>>n;for(inti=0;i>s[i];memcpy(backups,s,n);for(inti=0;i>t;while(t--)solve();return0;}非常激动啊自己也是独立ac了该题,写算法基础提高进阶或者算