ACM-ICPC或ICPC-国立中央大学.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * Tips 多準備(寫好)常用的函式或多使用C++ Standard Template Library E.G.#include stl.hstackint S;queuechar Q;priority_queueint PQ; stack - S.push(), S.top(), S.pop(), S.empty() You should always top on pop because top returns but does not remove the element on top, while pop removes but does not return the element. Linked implementations ensure the stack will never be full. queue – Q.front(), Q.back(), Q.push(), Q.pop(), and Q.empty() hash_map – H.erase(), H.find(), H.insert() priority_queue – PQ.push(), PQ.top(), PQ.pop(), PQ.empty() set – S.set_union, S.s