华为OD笔试记录

第一题比较简单，输出前n个不重复的最大和最小的数之和，如果有前n大和前n小的数之间有重复，输出-1.

#include<iostream>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
int main() {
	int n,t=0,k,ans=0,s;
	map<int, int> vis;
	vector<int> nums;
	cin >> n;
	
	while (n--) {
		cin >> t;
		if (vis.count(t)) {
			continue;
		}
		else {
			vis[t] = 1;
			nums.push_back(t);
		}

	}
	sort(nums.begin(), nums.end());
	s = nums.size();
	cin >> k;
	if (s < k*2) {
		cout << -1;
	}else {
		for (int i = 0; i < k; i++) {
			ans += nums[i];
			ans += nums[s - 1 - i];
		}
		cout << ans << endl;
	}
	
	return 0;
}

第二题是判断两个节点是否相连，基础并查集。

#include<iostream>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
/*
5 6
1 2 0
1 2 1
1 5 0
2 3 1
2 5 1
1 3 2

we are a team
we are not a team
we are a team
da pian zi
*/
long long n, m , a, b, c;
long long f[100005];
long long findf(int x) {
	int x1 = x,t;
	while (f[x] != x) {
		x = f[x];
	}
	while (f[x1] != x) {
		t = f[x1];
		f[x1] = x;
		x1 = t;
	}
	return x;
}
void unionf(int x, int y) {
	if (x < y) swap(x, y);
	int xf = findf(x), yf = findf(y);
	if (xf < yf) {
		f[yf] = xf;
		f[y] = xf;
	}
	else {
		f[xf] = yf;
		f[x] = yf;
	}
}
bool judgef(int x, int y) {
	return findf(x) == findf(y);
}
int main() {
	cin >> n >> m;
	if (n < 1 || n>100000 || m < 1 || m>100000) {
		printf("NULL\n");
		return 0;
	}
	for (int i = 1; i <= n; i++) {
		f[i] = i;
	}
	while (m--) {
		cin >> a >> b >> c;
		if (c == 0 && a >= 1 && a <= n && b >= 1 && b <= n) {
			unionf(a, b);
		}
		else if (c == 1 && a >= 1 && a <= n && b >= 1 && b <= n) {
			if (judgef(a, b)) {
				printf("we are a team\n");
			}
			else {
				printf("we are not a team\n");
			}
			//cout << (judgef(a, b) ? "we are a team" : "we are not a team") << endl;
		}
		else {
			printf("da pian zi\n");
		}
	}
	return 0;
}

第三题是找出矩阵中最长的一条线，这条线可以是水平垂直对角反对角四种情况，简单dp。

#include<iostream>
#include<algorithm>
#include<map>
#include<vector>
#include<string>
using namespace std;
/*
4 4
F,M,M,M
F,F,M,F
F,M,F,M
M,F,F,F
3
4 4
M,M,M,F
M,F,F,F
M,F,F,M
M,F,F,M
4 4
M,M,M,M
F,M,F,F
F,F,M,M
F,F,F,F
4 4
M,M,M,F
F,M,F,F
F,F,M,M
F,F,F,M
*/
int dp[10005][10005];
int sq[10005][10005];

void build(string& s, int i) {
	int ssize = s.size(),ii=0;
	for (int j = 0; j < ssize;) {
		if (s[j] == 'F') {
			sq[i][ii++] = 0;
		}
		else if(s[j] == 'M'){
			sq[i][ii++] = 1;
		}
		j += 2;
	}
}
int main() {
	int n, m,ans = 0;
	//cin >> n >> m;
	scanf("%d,%d", &n, &m);
	string s;
	for (int i = 0; i < n; i++) {
		cin >> s;
		build(s, i);
	}

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (sq[i][j] == 1) {
				dp[i][j] = 1;
				if (j - 1 >= 0 && sq[i][j - 1] == 1) {
					dp[i][j] = dp[i][j - 1] + 1;
				}
				ans = max(dp[i][j], ans);
			}
			else {
				dp[i][j] = 0;
			}
			
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (sq[i][j] == 1) {
				dp[i][j] = 1;
				if (i - 1 >= 0 && sq[i-1][j] == 1) {
					dp[i][j] = dp[i-1][j] + 1;
				}
				ans = max(dp[i][j], ans);
			}
			else {
				dp[i][j] = 0;
			}

		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (sq[i][j] == 1) {
				dp[i][j] = 1;
				if (j - 1 >= 0&&i-1>=0 && sq[i-1][j - 1] == 1) {
					dp[i][j] = dp[i-1][j - 1] + 1;
				}
				ans = max(dp[i][j], ans);
			}
			else {
				dp[i][j] = 0;
			}

		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (sq[i][j] == 1) {
				dp[i][j] = 1;
				if (j + 1 < m && i - 1 >= 0 && sq[i - 1][j + 1] == 1) {
					dp[i][j] = dp[i - 1][j + 1] + 1;
				}
				ans = max(dp[i][j], ans);
			}
			else {
				dp[i][j] = 0;
			}

		}
	}
	cout << ans <<endl;
	return 0;
}

运气比较好，三道都不难。