Codeforces 1304D. Shortest and Longest LIS 代码（构造 贪心）

https://codeforces.com/contest/1304/problem/D

 #include<bits/stdc++.h>
 using namespace std;
 void solve(){
     int n;
     string s;
     cin>>n;
     cin>>s;
     int Min[n];
     int t = n;
     for(int i = ;i<s.length();i++){
         int len = ,indx = i;
         if(s[i] == '<'){
             while(s[i]=='<'){
                 len++;
                 i++;
             }
         }
         for(int j = i;j>=i-len;j--){
             Min[j] = t,t--;
         }
     }
     if(t) Min[n-] = t;
     t = ;
     int Max[n];
     for(int i = ;i<s.length();i++){
         int len = ,indx = i;
         if(s[i] == '>'){
             while(s[i]=='>'){
                 len++;
                 i++;
             }
         }
         for(int j = i;j>=i-len;j--){
             Max[j] = t,t++;
         }
     }
     if(t == n) Max[n-] = t;
     for(int i = ;i<n;i++) cout<<Min[i]<<" ";
     cout<<endl;
     for(int i = ;i<n;i++) cout<<Max[i]<<" ";
     cout<<endl;
 }
 int main(){
     int t;
     cin>>t;
     while(t--){
         solve();
     }
     return ;
 }