Hard Refactoring

来源：互联网发布：咨询公司面试数据分析编辑：程序博客网时间：2024/05/22 10:59

Statements

这题主要要处理好输入问题

#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<iostream>#define inf 999999999using namespace std;struct node{int l,r;}a[50000];bool cmp(const node &a,const node &b){if(a.l==b.l)return a.r<b.r;else return a.l<b.l;}int main(){freopen("hard.in","r",stdin);freopen("hard.out","w",stdout);char s[500];int num=0;while(~scanf("%s",s)){num++;a[num].l=-32768;//这里我用inf就错了，不知道为什么 a[num].r=32767;int x;scanf("%s%d",s,&x);if(s[0]=='>'){a[num].l=max(x,a[num].l);}else a[num].r=min(x,a[num].r);if(scanf("%s",s)==EOF)break;if(s[0]!='&')continue;scanf("%s",s);scanf("%s%d",s,&x);if(s[0]=='>'){a[num].l=max(x,a[num].l);}else a[num].r=min(x,a[num].r);if(scanf("%s",s)==EOF)break;}sort(a+1,a+num+1,cmp);int i;int sum=0;int n=0;for(i=1;i<=num;i++){if(a[i].l>a[i].r)sum++;else if(n>0&&a[i].l<=a[n].r+1){a[n].r=max(a[i].r,a[n].r);}else{n++;a[n].l=a[i].l;a[n].r=a[i].r;}}if(sum==num)printf("false\n");else if(a[1].l<=-32768&&a[1].r>=32767)printf("true\n");else{for(i=1;i<=n;i++){if(a[i].l<=-32768)printf("x <= %d",a[i].r);else if(a[i].r>=32767)printf("x >= %d",a[i].l);else{printf("x >= %d && x <= %d",a[i].l,a[i].r);}if(i!=n)printf(" ||\n");else printf("\n");}}return 0;}

阅读全文

0 0