B. Far Relative’s Problem
2016-03-11 13:54
405 查看
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 bi inclusive.
Output
Print the maximum number of people that may come to Famil Door's party.
Examples
input
output
input
output
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.
题意是有n个人,M表示男人,F表示女人,输入每个人能够到来的时间段,要求男女到来人数相同的最大人数。
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 bi inclusive.
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.
题意是有n个人,M表示男人,F表示女人,输入每个人能够到来的时间段,要求男女到来人数相同的最大人数。
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> using namespace std; const int Max = 370; int n,a[Max],b[Max],l,r; char temp; int main() { cin>>n; for(int i=0;i<n;i++){ cin>>temp>>l>>r; if(temp=='M'){ for(int j=l;j<=r;j++){ a[j]++; } } else{ for(int j=l;j<=r;j++){ b[j]++; } } } int ans=0; for(int i=1;i<=Max;i++){ ans=max(ans,min(a[i],b[i])); } cout<<2*ans<<endl; return 0; }
相关文章推荐
- 自定义Theme统一Activity的跳转动画
- 指针使用时注意事项
- jsoup爬取指定网页的url和图片
- Java之数列求逆序数
- Cgroups7 ns子系统
- Java并发编程-Lock
- 事务,视图,索引
- windows7下添加 在当前目录打开Cygwin
- Service
- sql日期按月份和年份分组查询
- 调查表与调查结果分析
- gradle存放目录
- RMAN-03009 ORA-19809 ORA-19804
- Linux 命令
- 节省苹果手机电源,优化APP耗电
- Cgroups4 子系统的实现
- Cgroups5 devices子系统
- Cgroups6 freezer子系统
- HTTP协议基础
- JS验证电话和传真号码格式