P6114 Lyndon 分解【模板】

#include
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const int N=2e5+10;
string s;
int main(){
    ios::sync_with_stdio(false);
    int ans=0;
    cin>>s;
    int n=s.size();
    s=" "+s;
    int i;
    for(i=1;i<=n;){
        int j=i;
        int k=i+1;
        while(k<=n&&s[j]<=s[k]){
            if(s[j]<s[k]){
                j=i;
            }
            else j++;
            k++;
        }
        while(i<=j){
            ans^=i+k-j-1;
            i+=k-j;
        }
    }
    cout<endl;
}

View Code