全RE!蒟蒻求助!

P1203 [USACO1.1] 坏掉的项链 Broken Necklace

``` #include <bits/stdc++.h> using namespace std; int n,ans=0; char a[10005]; int main() { cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; } for(int i=1;i<=n;i++) { a[i+n]=a[i]; a[i+2*n]=a[i]; } for(int i=1;i<=2*n;i++) { int s=0; char x=a[i-1]; for(int j=i-1;j>=1;j--) { if(x==a[j] || a[j]=='w') { s++; } else if(x=='w') { x=a[j]; s++; } else { break; } } x=a[i]; for(int j=i;j<=2*n;j++) { if(x==a[j] || a[j]=='w') { s++; } else if(x=='w') { x=a[j],s++; } else { break; } } ans=max(ans,s); } ans=min(ans,n); cout<<ans<<"\n"; return 0; } ```
by RicardoLu @ 2021-07-23 13:19:03


|