2023 CSP-S 消消乐 题解
[2023 CSP-S T2]消消乐解法关系图1234graph LRA(N^3_算法1) -- 优化 -->B(N^2_算法2)B -- 启发 --> C(哈希N^2_算法3)B -- DP --> D(N_算法4) 算法一 (35pts)枚举每一个子串，用栈判断子串是否合法，预计 $35pts$。 12345678910111213141516171819202122232425#include <bits/stdc++.h>#define int long longusing namespace std;int n;char a[2000005];int ans;signed main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; cin >> a + 1; for(int i = 1; i <= n - 1; i++) { for(int j = i + 1; j <= n; j++) &...
Hello World
Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub. Quick StartCreate a new post1$ hexo new "My New Post" More info: Writing Run server1$ hexo server More info: Server Generate static files1$ hexo generate More info: Generating Deploy to remote sites1$ hexo deploy More info: Deployment
