【codeforces】 Far Relative’s Problem

这不能算贪心题吧

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[380],m1[380],m2[380];
int main() {
    int n;
    while(scanf("%d",&n)!=EOF) {
        int began,end;
        char c;
        memset(a,0,sizeof(a));
        memset(m1,0,sizeof(m1));
        memset(m2,0,sizeof(m2));
        for(int l=0; l<n; l++) {
            getchar();
            scanf("%c%d%d",&c,&began,&end);
            if(c=='M')
                for(int j=began; j<=end; j++)
                    m1[j]++;
            else
                for(int j=began; j<=end; j++)
                    m2[j]++;
        }
        for(int l=0; l<380; l++) {
            a[l]=2*min(m1[l],m2[l]);
        }
        printf("%d\n",*max_element(a,a+380));
    }
    return 0;
}

http://acm.hust.edu.cn/vjudge/contest/123357#problem/H