Codeforces 629B Far Relative’s Problem(简单区间贪心)
来源:互联网 发布:吉林一号卫星数据 编辑:程序博客网 时间:2024/05/07 09:02
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
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;}
- Codeforces 629B Far Relative’s Problem(简单区间贪心)
- Codeforces 629B Far Relative’s Problem(简单区间贪心)
- Codeforces 629B Far Relative’s Problem 区间贪心
- 【Codeforces】-629B-.Far Relative’s Problem(贪心.时间区间)
- Codeforces 629B(贪心Far Relative’s Problem
- CodeForces - 629B Far Relative’s Problem (贪心
- 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 Far Relative’s Problem(区间贪心)
- CodeForces Far Relative’s Problem (贪心)
- 【Codeforces 贪心】Far Relative’s Problem
- CodeForces NO.629B Far Relative’s Problem
- CodeForces 629 B. Far Relative’s Problem(水~)
- Codeforces 629B Far Relative’s Problem 【水题】
- Codeforces--629B--Far Relative’s Problem(模拟)
- CodeForces 629B Far Relative’s Problem(暴力)
- cmder ——windows下cmd的完美替换工具分享
- js判断字符串出现最多的字符
- jdk环境变量配置
- Linux ps 命令
- 设计模式之策略模式理解
- Codeforces 629B Far Relative’s Problem(简单区间贪心)
- Centos6.5查看nginx并发连接数和TCP连接状态命令
- Linux下chkconfig命令详解
- 网络运维相关文章
- 测试线段是否相交
- Android 图片如何高效加载与缓存 (2) —— 增加图片处理接口
- <等待翻译>Android Wear 进阶 2.4 Adding Voice Capabilities 添加语音功能
- jee6 EJB- Singleton EJB
- Java虚拟机学习 - 体系结构 内存模型