那是算法错了，不能暴力，这题数据加强过了。
by 紊莫 @ 2022-08-11 21:19:46
@[FrozenDream](/user/212423)
by 紊莫 @ 2022-08-11 21:19:49
@[Velvet](/user/443675) 已经知道正解了，谢谢您，此帖终
by FrozenDream @ 2022-08-12 08:59:11
@[FrozenDream](/user/212423) 还可以卡时间，只要第25行执行超过4000次就break，并且选左边的
by LKX_Wata @ 2023-02-04 09:56:21
```
#include<iostream>
char s[500001];
int n,l,r;
inline int read(){
register int x=0,f=1;
char ch=getchar();
while(ch<'0' || ch>'9'){
if(ch == '-') f = -1;
ch = getchar();
}
while(ch>='0' && ch<='9'){
x = (x<<1)+(x<<3)+(ch^48);
ch = getchar();
}
return x*f;
}
int main(){
n = read();
r = n-1;
for(register int i = 0;i < n-1;++i){
s[i] = getchar();
getchar();
}
s[n-1] = getchar();
while(l <= r){
bool left = false;
for(register int i = 0;l+i <= r;++i){
if(s[l+i] < s[r-i]){
left = true;
break;
}
else if(s[l+i] > s[r-i]) break;
}
if(left) putchar(s[l++]);
else putchar(s[r--]);
if((l+n-1-r)%80 == 0) puts("");
}
return 0;
}
```
me too!
by hnxxwpf @ 2023-11-05 13:50:38