Coldarra

摘要： G.Longest Path 拓扑排序$dp$ #include <bits/stdc++.h> using namespace std; using ll = long long; int dp[100010], d[100010]; void solve() { int n, m; scanf( 阅读全文

摘要： A.Number Replacement void solve() { int n; cin >> n; vector<int> a(n), vis(n); for (int i = 0; i < n;i++) cin >> a[i]; string s; cin >> s; map<int, ch 阅读全文