画个图,很容易发现少兜圈子,就是说这些限制c[i],d[i]可以看做[c[i],d[i]],不让那些区间相交,然后就可以了 #include<iostream> #include<cstdio> using namespace std; ]; int main() { int n,m;scanf("%d%d",&n,&m); ;i<=m;i++) { int c,d;scanf("%d%d",&c,&d)…

Shopping 题目连接: http://codeforces.com/gym/100803/attachments Description Your friend will enjoy shopping. She will walk through a mall along a straight street, where N individual shops (numbered from 1 to N) are aligned at regular intervals. Each shop…