buaapascal的博客

DFS求最短路径#include<cstdio> #include<cstring> #include<iostream> #include<sstream> #include<algorithm> #include<cctype> #include<vector> #include<iomanip&

Suppose a bank has K windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the customers have to wait in line behind the yellow li...