hnustleoyue的博客

Best Cow Line Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 25392   Accepted: 6918 Description FJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual

#include #include #include #include using namespace std; struct node { int s,e; int val; } flag[1200000]; int map1[1200000]; int cmp(node a,node b) { if(a.val<b.val) return 1;