CF 343div2 B 暴力

题目连接

http://codeforces.com/contest/629/problem/B

Description

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.

Sample Input

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

Sample Output

2

Hint

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

题意

找到一个日子，使那一天一对一对的男女的对数最多，并打印人数

题解

超级暴力法，直接把每一天可能出现的次数计数，然后最后扫描一次

代码

#include<bits/stdc++.h>
using namespace std;
int a[2][5010];

int main(int argc, char const *argv[])
{
    int n;
    cin>>n;
    for (int i = 0; i < n; ++i)
    {
        char peo;
        int p,q;
        cin>>peo>>p>>q;
        if (peo=='M')
        {
        for (int i = p; i<=q ; ++i)
        {
            a[0][i]++;          
        }
        }
        else{
            for (int i = p; i<=q ; ++i)
            {
                a[1][i]++;
            }
        }

    }
    int ans=0;
    for (int i = 1; i <=366; ++i)
    {
         ans=max(ans,2*min(a[0][i],a[1][i]));
    }
    printf("%d\n",ans );
    return 0;
}

Get

• max用法
• 用两行表示男女，攒数