Codeforces Round #343 (Div. 2) B. Far Relative’s Problem
来源:互联网 发布:高清网络电视直播 编辑:程序博客网 时间:2024/05/18 01:51
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.
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.
Print the maximum number of people that may come to Famil Door's party.
4M 151 307F 343 352F 117 145M 24 128
2
6M 128 130F 128 131F 131 140F 131 141M 131 200M 140 200
4
由于比数据范围比较少,所以可以直接记录每个点出现的次数
#include <bits/stdc++.h>using namespace std;int du1[400],du2[400];int main(){ int n,l,r; while(~scanf("%d",&n)) { memset(du1, 0, sizeof(du1)); memset(du2, 0, sizeof(du2)); char str[2]; while(n--) { scanf("%s",str); scanf("%d %d",&l,&r); if(str[0] == 'F') { for(int i=l; i<=r; i++) du1[i]++; } else { for(int i=l; i<=r; i++) du2[i]++; } } int MAX = 0; for(int i=0; i<=366; i++) MAX = max(min(du1[i],du2[i])*2,MAX); printf("%d\n",MAX); } return 0;}
- Codeforces Round #343 (Div. 2) B. Far Relative’s Problem
- Codeforces Round #343 (Div. 2) B. Far Relative’s Problem
- Codeforces Round #343 (Div. 2) -B. Far Relative’s Problem(模拟)
- Codeforces Round #343 (Div. 2) B. Far Relative’s Problem (贪心)
- Codeforces Round #343 (Div. 2) B. Far Relative’s Problem (线段树+区间更新+单点查询)
- Codeforces Round #343 (Div. 2) B. Far Relative’s Problem(O(1)的线段标记)
- Codeforces Round #343 (Div. 2) Far Relative’s Birthday Cake
- CodeForces 629B Far Relative’s Problem
- 【CodeForces】[629B]Far Relative’s Problem
- CodeForces-629B-Far Relative’s Problem
- 【Codeforces 629 B Far Relative’s Problem】
- Codeforces Round #343 (Div. 2) A. Far Relative’s Birthday Cake
- Codeforces Round #343 (Div. 2) -A. Far Relative’s Birthday Cake(组合+模拟)
- 【codeforces】Far Relative’s Problem
- 【codeforces】 Far Relative’s Problem
- B. Far Relative’s Problem
- Codeforces 629B Far Relative’s Problem(简单区间贪心)
- CodeForces NO.629B Far Relative’s Problem
- ubuntu连不上无线网
- 228. Summary Ranges
- Android中View自定义XML属性详解以及R.attr与R.styleable的区别
- Spring 框架的设计理念与设计模式分析
- 【慕课笔记】第三章 JAVA中必须了解的常用类 第1节 JAVA中的包装类
- Codeforces Round #343 (Div. 2) B. Far Relative’s Problem
- <%@ include file=""%>与<jsp:include page=""/>区别
- ubuntu初探3---常见命令
- Android 实时监测(监听)网络连接状态变化
- SSM——SpringMVC
- NSURLSession
- JS获取网页高宽
- STL高频面试题
- jquery 实现类似于百度自动匹配搜索