友好城市  解题思路：不交叉，则将北岸的坐标从小到大排，找南岸的最长上升子序列AC_Code1#include<iostream>2#include<cstdio>3#include<cmath>4#include<algorithm>5#includ...