DAY15.1 B. Good String

DAY15.1 B. Good String

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
You have a string ss of length nn 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−1n−1, but not the whole string). You need to calculate the minimum number of characters to be deleted from string ss so that it becomes good.

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

The first line of ii-th test case contains one integer nn (1≤n≤1001≤n≤100) – the length of string ss.

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

Output
For each test case print one line.

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

Example
inputCopy
3
2
<>
3

<<
1

outputCopy
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: > < < →→ < < →→ <.

思路&过程

找到最左边的“>”,把它左边的“<”都删掉
或者最右边的“<”,把它右边的“>”都删掉
选取较优的那一种

代码：

#include<iostream>
using namespace std;

int main()
{
	int T,i,j,m,n,p,r,ans;
	bool t;
	char s[110];
	cin>>T;
	while(T--)
	{
		cin>>n;
		cin>>s;
		p=0;
		while(p<=n&&s[p]=='<')
		{
			p++;
		}
		r=n-1;
		while(r>=0&&s[r]=='>')
		{
			r--;
		}
		if ((p==n)||(r==-1))
		{
			cout<<"0"<<endl;
		}
		else 
			if((p)<(n-r-1)) cout<<p<<endl;
			else cout<<n-r-1<<endl;
	}
	return 0;
 }