#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#define maxn 100005
#define INF 0xfffffff
using namespace std;
string fu,x;
int n;
int flag[100];
double c[100];
double co[200];
int fun(double num){
int ans=0;
for(int i=0;i<n;i++){
if(flag[i]==0){
if(num<c[i]) ans++;
}
else if(flag[i]==1){
if(num==c[i])ans++;
}
else if(flag[i]==2){
if(num>c[i])ans++;
}
else if(flag[i]==3){
if(num<=c[i])ans++;
}
else if(flag[i]==4){
if(num>=c[i])ans++;
}
}
return ans;
}
int main(){
while(cin>>n){
int cor=0;
for(int i=0;i<n;i++){
cin>>x>>fu>>c[i];
if(fu=="<") flag[i]=0;
if(fu=="=") flag[i]=1;
if(fu==">") flag[i]=2;
if(fu=="<=") flag[i]=3;
if(fu==">=") flag[i]=4;
co[cor++]=c[i];
co[cor++]=c[i]+0.000001;
co[cor++]=c[i]-0.000001;
}
int ans=0;
for(int i=0;i<cor;i++){
ans=max(ans,fun(co[i]));
}
printf("%d\n",ans);
}
return 0;
}
hihoCoder挑战赛14 A 不等式
最新推荐文章于 2016-10-05 12:05:31 发布