Cathy1122334455的博客

#include <iostream>#define N 10000using namespace std;int main(){ int i, n, a[N], left = 0, right = 0, maxsum = -1, currentsum = 0, temp = 0; cin >> n; for (i = 0; i <...

#include <bits/stdc++.h>using namespace std;struct Elem{ bool isSelec = false; int data;};int ElemCntinEachCircle(Elem* A, int pos);int main(){ #ifdef ONLINE_JUDGE #else freopen("in.t...

#include <bits/stdc++.h>using namespace std;map<string, string> M;int main(){ #ifdef ONLINE_JUDGE #else freopen("in.txt", "r", stdin); #endif int N; scanf("%d", &N); char ...

#include <bits/stdc++.h>using namespace std;bool isPrime(int n);int main(){ #ifdef ONLINE_JUDGE #else freopen("in.txt", "r", stdin); #endif int Max, N; //Max用来存储哈希表的长度 scanf("%d%d", ...

#include <bits/stdc++.h>using namespace std;map<long long, int> p;int main(){ #ifdef ONLINE_JUDGE #else freopen("in.txt", "r", stdin); #endif int N; scanf("%d", &N); int i...

#include <bits/stdc++.h>using namespace std;int main(){ #ifdef ONLINE_JUDGE #else freopen("in.txt", "r", stdin); #endif int N, key; cin >> N; map<int, int> M; int i; fo...

#include <bits/stdc++.h>using namespace std;int main(){ #ifdef ONLINE_JUDGE #else freopen("in.txt", "r", stdin); #endif int N; cin >> N; int A[N], B[N]; int i, j; int cnt;...

#include <bits/stdc++.h>using namespace std;int main(){ #ifdef ONLINE_JUDGE #else freopen("in.txt", "r", stdin); #endif int N; cin >> N; int v1[N], v2[N]; int i, j; int len...

#include <bits/stdc++.h>using namespace std;const int maxn = 100;int mapn[maxn][maxn], dis[maxn];int in[maxn];int n, m;int toposort();int main(){ #ifdef ONLINE_JUDGE #else freope...

#include <bits/stdc++.h>using namespace std;const int inf = 999999;int n, m; //N为城镇数目，M为候选道路数目int g[1000][1000]; //g[][]用来存储城镇之间的距离int x, y, z; //初始化时x,y用作一条路径两端的城镇，z用作路径的长度 int cost[10...

#include <bits/stdc++.h>using namespace std;typedef int Pos;#define NotFound -1void BuildMatch(char *pattern, int *match);Pos KMP(char *str, char *pattern);int main(){ #ifdef ONLINE_JU...