Good String

Posted 2021-05-15 karshey

You have a string s of length n consisting of only characters > and <. You may do some operations with this string, for each operation you have to choose some character that still remains in the string. If you choose a character >, the character that comes right after it is deleted (if the character you chose was the last one, nothing happens). If you choose a character <, the character that comes right before it is deleted (if the character you chose was the first one, nothing happens).

For example, if we choose character > in string > > < >, the string will become to > > >. And if we choose character < in string > <, the string will become to <.

The string is good if there is a sequence of operations such that after performing it only one character will remain in the string. For example, the strings >, > > are good.

Before applying the operations, you may remove any number of characters from the given string (possibly none, possibly up to n−1, but not the whole string). You need to calculate the minimum number of characters to be deleted from string s so that it becomes good.

Input
The first line contains one integer t (1≤t≤100) – the number of test cases. Each test case is represented by two lines.

The first line of i-th test case contains one integer n (1≤n≤100) – the length of string s.

The second line of i-th test case contains string s, consisting of only characters > and <.

Output
For each test case print one line.

For i-th test case print the minimum number of characters to be deleted from string s so that it becomes good.

Example

Input
3
2
<>
3
><<
1
>
Output
1
0
0

Note
In the first test case we can delete any character in string <>.

In the second test case we don’t need to delete any characters. The string > < < is good, because we can perform the following sequence of operations: > < < → < < → <.

>后的删去，<前的删去。因此，找到第一个>或最后一个<，输出它们的min。

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
	//>后的删去，<前的删去 
	int n;
	cin>>n;
	while(n--)
	{
		int m,d=0,x=0;
		cin>>m;
		vector<char>v;
		vector<char>::iterator iter;
		char ch;
		for(int i=0;i<m;i++)
		{		
			cin>>ch;
			v.push_back(ch);
			if(ch=='<') x++;
			else d++;			
		}
		
		if(d==0||x==0) cout<<0<<endl;
		else
		{
			//找第一个>
			int d1=0;
			for(int i=0;i<m;i++)
			{
				if(v[i]=='>')
				{
					d1=i;
					break;
				}
			}
			
			//找最后一个< 
			int x1=0;
			for(int i=0;i<m;i++)
			{
				if(v[i]=='<')
				{
					x1=i;					
				}
			}
			
			x1=m-1-x1;
			cout<<min(d1,x1)<<endl;
		}
	}
	return 0;
}