S_Black的专栏

B. Strongly Connected Citytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputImagine a city with n horizontal

C. Kamal-ol-molk's Paintingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRumors say that one of Kamal-ol

A strange liftTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17322    Accepted Submission(s): 6504Problem DescriptionThere is a

Train Problem I题目链接 Train Problem I题目大意 就是有一个栈，给定一个初始序列和一个最终序列，求初始序列能否通过一种进栈出栈的方式打到最终序列。题解 就是一个暴搜的问题…数据很小。 用栈的时候需要小心一点不要丢失数据。代码（有些冗长）#include <iostream>#include <cstdio>#include <cstring>usin