寒假Day32：CodeForces 1304-思维

Shortest and Longest LIS

 CodeForces - 1304D 

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
const int N=2e5+20;

char s[N];
int a[N],b[N];

int main()
{
    int t,n;
    cin>>t;
    while(t--)
    {
        scanf("%d %s",&n,s);
        int p=0,nn=n;
        for(int i=0; i<n; i++)
        {
            if(i==n-1||s[i]=='>')
            {
                for(int j=i; j>=p; j--)
                    a[j]=nn--;
                p=i+1;
            }
        }
        int q=0,x=1;
        for(int i=0; i<n; i++)
        {
            if(i==n-1||s[i]=='<')
            {
                for(int j=i; j>=q; j--)
                    b[j]=x++;
                q=i+1;
            }
        }
        for(int i=0; i<n-1; i++)
            cout<<a[i]<<" ";
        cout<<a[n-1]<<endl;
        for(int i=0; i<n-1; i++)
            cout<<b[i]<<" ";
        cout<<b[n-1]<<endl;
    }
    return 0;
}