A.相遇时间段l = max(l1,l2),r = min(r1,r2),再判断k是否在里面. #include <iostream> using namespace std; long long l1,l2,r1,r2,k; int main() { cin >> l1 >> r1 >> l2 >> r2 >> k; long long l = max(l1,l2),r = min(r1,r2); << endl; el…