Codeforces 629B Far Relative’s Problem(简单区间贪心)

B. Far Relative’s Problem

time limit per test

 2 seconds

memory limit per test

 256 megabytes

input

 standard input

output

 standard output

Famil Door wants to celebrate his birthday with his friends from Far Far Away. He has n friends and each of them can come to the party in a specific range of days of the year from ai to bi. Of course, Famil Door wants to have as many friends celebrating together with him as possible.

Far cars are as weird as Far Far Away citizens, so they can only carry two people of opposite gender, that is exactly one male and one female. However, Far is so far from here that no other transportation may be used to get to the party.

Famil Door should select some day of the year and invite some of his friends, such that they all are available at this moment and the number of male friends invited is equal to the number of female friends invited. Find the maximum number of friends that may present at the party.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 5000) — then number of Famil Door's friends.

Then follow n lines, that describe the friends. Each line starts with a capital letter 'F' for female friends and with a capital letter 'M' for male friends. Then follow two integers ai and bi (1 ≤ ai ≤ bi ≤ 366), providing that the i-th friend can come to the party from day ai to day biinclusive.

Output

Print the maximum number of people that may come to Famil Door's party.

Examples

input

4
M 151 307
F 343 352
F 117 145
M 24 128

output

2

input

6
M 128 130
F 128 131
F 131 140
F 131 141
M 131 200
M 140 200

output

4

Note

In the first sample, friends 3 and 4 can come on any day in range [117, 128].

In the second sample, friends with indices 3, 4, 5 and 6 can come on day 140.

 

题意：每个人都有自己特定的出门时间段ai~bi。 FD想邀请一些人参见自己的聚会，要求来参加的男女人数相等。 FD最多能邀请多少人参加？

题解：分别记录每段时间能参加宴会的男子人数和女子人数。 最后找到某个时间内 min(男子人数，女子人数)最大。结果乘2即可。

#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
	int m[400]={0};
	int f[400]={0};
	int n;
	scanf("%d",&n);
	char s[10];
	int i,j;
	int begin,end;
	for(i=1;i<=n;i++)
	{
		getchar();
		scanf("%c%d%d",&s[0],&begin,&end);
		if(s[0]=='M')
			for(j=begin;j<=end;j++)
				m[j]++;
		if(s[0]=='F')
			for(j=begin;j<=end;j++)
				f[j]++;
	}
	int ans=0;
	for(i=1;i<=400;i++)
	{
		if(m[i]&&f[i])
		{
			int temp=min(m[i],f[i]);
			ans=max(ans,temp);
		}
	}
	printf("%d\n",ans*2);
	return 0;
}