Southern Subregion Problem H. Password Service

这题坑了有一会 直接粘的队友代码 WA54注意一种样例  >>><>>>>

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    char a[5005],ans[5005],b[5005];
    cin>>a;
    strcpy(b,a);
    //cout<<b<<endl;
    memset(ans,'\0',sizeof(ans));
    int len=strlen(a);
    int sum=0,min1=0,max1=0,cnt=0,i=0;
    while(a[i]=='=')
    {
        i++;
        cnt++;
    }
    if(a[i]=='>')
        ans[i]='a'+n-1;
    if(a[i]=='<')
        ans[i]='a';
    if(cnt==len){
        for(int j=0;j<cnt;j++)
            ans[j]='a';
    }
    else{
        for(int j=0;j<cnt;j++)
            ans[j]=ans[i];
    }
    i++;
    //cout<<ans<<endl;
    for(;i<len;i++){
        if(a[i]=='>'&&a[i-1]=='>')
        ans[i]=ans[i-1]-1;
        if(a[i]=='<'&&a[i-1]=='>')
        ans[i]=min('a'+0,ans[i-1]-1);
        if(a[i]=='<'&&a[i-1]=='<')
        ans[i]=ans[i-1]+1;
        if(a[i]=='>'&&a[i-1]=='<')
        ans[i]=max('a'+n-1,ans[i-1]+1);
        if(a[i]=='='&&a[i-1]=='>'){
            a[i]=a[i-1];
            ans[i]=ans[i-1];
        }
        if(a[i]=='='&&a[i-1]=='<'){
            a[i]=a[i-1];
            ans[i]=ans[i-1];
        }
    }
    for(int j=len-2;j>=0;j--){
        if(b[j]=='='){
            ans[j]=ans[j+1];
        }
    }
    int kk=len-1;
    while(b[kk]=='=')
    {
        kk--;
    }
    kk++;
    if(b[kk-1]=='<')
        ans[kk]=ans[kk-1]+1;
    if(b[kk-1]=='>')
        ans[kk]=ans[kk-1]-1;
    kk++;
    //cout<<kk<<' '<<endl;
    for(;kk<len;kk++)
        ans[kk]=ans[kk-1];
    //cout<<ans<<endl;
    if(b[len-1]=='>')
    ans[len]=ans[len-1]-1;
    if(b[len-1]=='<')
    ans[len]=ans[len-1]+1;
    if(b[len-1]=='=')
    ans[len]=ans[len-1];
    int flag=0;
    for(int j=0;j<len+1;j++){
        if(ans[j]<'a'||ans[j]>'a'+n-1){
        flag=1;
        break;
        }
    }
    //cout<<max1<<min1;
    if(flag==1)
        cout<<"-1"<<endl;
    else
    {
        cout<<ans<<endl;
    }
    //cout << "Hello world!" << endl;
    return 0;
}