机试

A

#include <iostream>
#include <algorithm>
#include <fstream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
using namespace std;
int T, arr[5], ans;
int a[5], b[5];

void DFS(int index, int now, int sum) {
	if (index == 5 && now == 3) {
		if ( sum == 0 || sum % 10 == 0 ) {
			ans = sum;
			return;
		}
	}
	if (index == 5 || now > 3 ) {
		return;
	}
	DFS(index + 1, now + 1, sum + arr[index]);
	DFS(index + 1, now, sum);
}

int main() {
	scanf("%d", &T);
	while (T--) {
		int temp=0;
		ans = -1;
		for (int i = 0; i < 5; i++) {
			scanf("%d", &arr[i]);
			temp += arr[i];
		}
		DFS(0, 0, 0);
		if (ans == -1) {
			printf("-1\n");
		}
		else printf("%d", (temp-ans)%10);
	}
	return 0;
}

B

#include <iostream>
#include <algorithm>
#include <fstream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
using namespace std;

int main() {
	int n, d, arr[100010], count = 1;
	int now = 0;
	scanf("%d%d", &n, &d);
	for (int i = 0; i < n; i++) {
		scanf("%d", &arr[i]);
	}
	sort(arr, arr + n);
	for (int i = 1; i < n ; i++) {
		if (arr[i] - arr[now] >= d) {
			count++;
			now = i;
		}
	}
	printf("%d", count);
	return 0;
}

C

#include <iostream>
#include <algorithm>
#include <fstream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
using namespace std;
const int maxn = 100010;

struct Student {
	int ai;
	int  ti;
	int  bi;
	int  begin;
	bool T = false;
}s[maxn];

int main() {
	int n, time;
	int ai, bi, ti;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d%d%d", &ai, &ti, &bi);
		if (i == 1) time = ai;
		s[i].ai = ai;
		s[i].ti = ti;
		s[i].bi = bi;
		if (time < ai) {
			s[i].begin = ai;
			s[i].T = true;
			time = s[i].ai + s[i].ti;
		}
		else if (time <= ai + bi) {
			s[i].begin = time;
			s[i].T = true;
			time += ti;
		}
	}
	for (int i = 1; i <= n; i++) {
		if (s[i].T == true) {
			printf("%d", s[i].begin);
		}
		else printf("-1");
		if (i < n) printf(" ");
	}
	return 0;
}

D

#include <iostream>
#include <algorithm>
#include <fstream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
using namespace std;

struct node {
	int data;
	node *left, *right;
	node* father;
};

void insert(node* &root, int data) {
	if (root == NULL) {
		root = new node;
		root->data = data;
		root->left = root->right = NULL;
		return;
	}
	if (data < root->data) {
		insert(root->left, data);
	}
	else {
		insert(root->right, data);
	}
}

void inOrder(node* root, vector<node*>&fa, node* father) {
	if (root == NULL) {
		return;
	}
	root->father = father;
	father = root;
	inOrder(root->left, fa, father);
	fa.push_back(root);
	inOrder(root->right, fa, father);
}

vector<int> a;
vector<node*> fa;
int main() {
	int n, data;
	node* root = NULL;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &data);
		insert(root, data);
	}
	inOrder(root, fa, NULL);
	for (int i = 0; i < fa.size(); i++) {
		if (fa[i]->father == NULL) {
			printf("0");
		}
		else {
			printf("%d", fa[i]->father->data);
		}
		if (i < fa.size() - 1) printf(" ");
	}
	return 0;
}

E

#include <iostream>
#include <algorithm>
#include <fstream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
using namespace std;
const int maxn = 1010;
int dp[maxn][10], a[maxn];

int main() {
	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &a[i]);
	}
	fill(dp[0], dp[0] + n * 10, 0x3fffffff); //二维数组初始化为极大值
	for (int i = 0; i < 10; i++) {
		if (i == a[0]) {
			dp[0][i] = 0;
		}
		else {
			dp[0][i] = abs(a[0] - i);
		}
	}
	for (int i = 1; i < n; i++) {
		for (int j = 0; j < 10; j++) {
			for (int k = 0; k < 10; k++) {
				dp[i][j] = min(dp[i][j], dp[i - 1][k] + abs(a[i] - j) + (j - k)*(j - k));
			}
		}
	}
	int ans = 0x3fffffff;
	for (int i = 0; i < 10; i++) {
		ans = min(ans, dp[n - 1][i]);
	}
	printf("%d", ans);
	return 0;
}