摘要: DS +++ 1.单调栈 #include <iostream> using namespace std; const int N = 1e5 + 10; int stk[N], tt; int n; int main() { scanf("%d", &n); int x; for (int i = 阅读全文
posted @ 2020-09-26 16:45 sunnyday0725 阅读(76) 评论(0) 推荐(0) 编辑