TheAlgorithmArt的专栏

#include #define inf 1000000using namespace std;const int MAXN = 101;int map[MAXN][MAXN];int id[2][MAXN];int color[MAXN];int dp[MAXN][MAXN];int tmp[MAXN][MAXN];struct { int c1, c2; int i, j;}pre[MAXN][MAXN];int N, t;bool DFS(

<br />#include <iostream>#include <string>#include <algorithm>using namespace std;char key[11];char word[11][11];char str[101];struct INDEX{ int index; bool operator<(const INDEX& o)const { return key[this->index]<key[o.index]; }

<br />#include <iostream>using namespace std;int w, h;int step[4][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};int visit[1001][81];char map[1001][81];int ans;bool Check(int x, int y){if (x >= h || x < 0 || y >= w || y < 0)return false;retu

<br />#include <iostream>using namespace std;int N, ans;int map[101][101];int visit[101][101];int step[4][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};int color[101];bool Check(int x, int y){ if (x >= N || x < 0 || y >= N || y < 0) return f

<br />#include<iostream>#include<queue>using namespace std;int main(){ int t, n, m, x; cin>>t; while(t--) { cin>>n>>m; queue<int>q; priority_queue<int>v; for(int i=0; i<n; i++) { cin>>x; q.push(x); v.push(x);

#include #include using namespace std;int main(){ freopen("test.txt", "r", stdin); while(true) { string s1; string s2 = ""; getline(cin, s1); int l = s1.length(); bool flag = true; for (int i = 0; i

<br />#include <iostream>#include <vector>#include <string>#include <algorithm>using namespace std;int main(){ freopen("test.txt", "r", stdin); int n; vector<string> v; string s; int t = 1; while (cin>>s) { if (s[0] == '9')

水题#include using namespace std;char phone[10001][11];int cmp(const void* a, const void* b){ return strcmp((char*)a, (char*)b);}int main(){ int t, n; freopen("test.txt", "r", stdin); scanf("%d", &t); while (t--) { scanf("%d"

<br />#include <iostream>#include <string>using namespace std;string s1, s2;int l1, l2;int LCS(int x, int y){ if (x >= l1 || y >= l2) return 0; if (s1[x] == s2[y]) return 1+LCS(x+1, y+1); return max(LCS(x, y+1), LCS(x+1, y));}

<br />#include <iostream>using namespace std;int A, B, C;struct { int i; int j; int method;}visit[1001][1001];struct{ int a; int b; int deep;}queue[100001];int result;int ra, rb;void Show(int a, int b){ int method =