摘要: 题目链接 解法: 栈 1 #include <bits/stdc++.h> 2 # define LL long long 3 using namespace std; 4 5 const int mod=10007; 6 stack<char> ope; 7 stack<int> one; 8 s 阅读全文
posted @ 2020-02-04 15:08 feibilun 阅读(177) 评论(0) 推荐(0)
摘要: 题目链接 1 #include <bits/stdc++.h> 2 # define LL long long 3 using namespace std; 4 5 const int maxn=5000+10; 6 int n; 7 LL dis[maxn]; 8 int complete[max 阅读全文
posted @ 2020-02-04 09:13 feibilun 阅读(207) 评论(0) 推荐(0)