YYHCODE的博客

后三个题一个半小时AC，第一个题最后都只是11分。。。最后10分钟想起来用map，打表太大了。但是调试好切回去就到时间了????。留有遗憾。第二个题第一次交好像是19分，改了一下就AC了。后两个都是一次性AC。主要是觉得一个半小时做20分的题，自己就有点松懈了，一开始想过用map但是觉得打表好像也可以就陷进去了。...

小根堆的性质＋ 中序可以建树。#include <bits/stdc++.h>using namespace std;struct node { int data; node *lc, *rc;};vector<int> in, ans;node *tree (int inL, int inR) { if (inL > inR) return NULL; node *root = new node(); int k = inL, minNum = in

忘了当时怎么做了。。。#include <bits/stdc++.h>using namespace std;int G[250][250];vector<vector<int>> v;int main() { fill (G[0], G[0] + 250 * 250, 0); int n, m, a, b, k, len, now; scanf ("%d %d", &n, &m); v.resize(n + 1); for (in

模板题#include <bits/stdc++.h>using namespace std;struct node { int data, next;}Node[100000];vector<int> v, ans;int main() { int fAd, n, k, ad, data, next; scanf ("%d %d %d", &fAd, &n, &k); for (int i = 0; i < n; i++) {

差两个测试点#include <bits/stdc++.h>using namespace std;unordered_map<char, vector<string>> mp;vector<string> ans;void prt (string s) { for (int i = 0; i < 7; i++) { for (int j = 0; j < s.size(); j++) { if (j != 0) prin

#include <bits/stdc++.h>using namespace std;const int INF = 999999999;int G[1010][1010], start, n;vector<int> dis, temp; //jide resize (n + 1)vector<vector<int>> D, v;bool vis[1010];void Dijkstra(int s) { fill (dis.begin().

#include <bits/stdc++.h>using namespace std;struct node { int lc, rc; string data;}Node[50];bool vis[50];string s = "+-*% ";string post(int root) { if (root == -1) return ""; if (Node[root].lc != -1) return "(" + post(Node[root].lc) + Node.

#include <bits/stdc++.h>using namespace std;struct node { int next, data;}Node[100000];vector<int> v1, v2, maxV, minV, ans;int main () { int fAd1, fAd2, n, ad, data, next; scanf ("%d %d %d", &fAd1, &fAd2, &n); for (int i =.

#include <bits/stdc++.h>using namespace std;struct node { string s; int n;};bool isPrime (int n) { if (n <= 2) return false; for (int i = 2; i <= sqrt(n); i++) { if (n % i == 0) return false; } return true;}int gcd (int a, int b).