Moving Tables

http://acm.hdu.edu.cn/showproblem.php?pid=1050

#include <cstdio>#include <cstring>#include <algorithm>using namespace std;struct table{int a,b;}ta[205];int vis[205];int main(int argc, char *argv[]){int t;scanf("%d",&t);while(t--){int n,x,y;scanf("%d",&n);for(int i=0;i<n;i++){scanf("%d%d",&x,&y);if(x>y) swap(x,y);ta[i].a=(x+1)/2;ta[i].b=(y+1)/2;}memset(vis,0,sizeof(vis));for(int i=0;i<n;i++){if(ta[i].a==ta[i].b)vis[ta[i].a]++;elsefor(int j=ta[i].a;j<=ta[i].b;j++){vis[j]++;}}int ans=0;for(int i=0;i<201;i++)ans=max(ans,vis[i]);//通过经过某一点的最高次数判断; printf("%d\n",ans*10);}return 0;}