机试前的小准备

• 快速排序

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int partition(int* A, int left, int right) {
	int temp = A[left];
	while (left < right) {
		while (left < right && temp < A[right])
			right--;
		A[left] = A[right];
		while (left < right && A[left] <= temp)
			left++;
		A[right] = A[left];
	}
	A[left] = temp;
	return left;
}
void quicksort(int* A, int left, int right) {
	if (left < right) {
		int mid = partition(A, left, right);
		quicksort(A, left, mid - 1);
		quicksort(A, mid + 1, right);
	}
}
int main(void) {
	int a[10] = { 4,2,5,9,1,0,6,7,3,8 };
	quicksort(a,0,9);
	for (int i = 0; i < 10; i++) {
		printf("%d\t", a[i]);
	}
	system("pause");
	return 0;
}

• 全排序（掉包）

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
using namespace std;

int main(void) {
	int a[5] = { 1,2,3,4,5 };//必须在升序的情况下，才能生成

	do {
		printf("%d%d%d\n", a[0], a[1], a[2]);
	} while (next_permutation(a, a + 3));
	system("pause");

	return 0;
}

• 全排序（深搜）

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
using namespace std;
int a[5] = { 1,2,3,4,5 };
bool vis[5] = { false };
int printa[5];

void dfs(int k) {
	if (k == 5) {
		for (int i = 0; i < 5; i++) {
			printf("%d ", printa[i]);
		}
		printf("\n");
		return;
	}
	for (int i = 0; i < 5; i++) {
		if (vis[i] == false) {
			vis[i] = true;
			printa[k] = a[i];
			dfs(k + 1);
			vis[i] = false;
		}
	}

}
int main(void) {

	dfs(0);
	system("pause");
	return 0;
}

• 01背包

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main(void) {
	int n, V;
	int w[10], c[10], dp[10][10] = { 0 };

	scanf("%d %d", &n, &V);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &w[i]);
	}
	for (int i = 1; i <= n; i++) {
		scanf("%d", &c[i]);
	}
	for (int i = 1; i <= n; i++) {
		for (int v = 1; v <= V; v++) {
			if (w[i] > v)
				dp[i][v] = dp[i - 1][v];
			else
				dp[i][v] = max(dp[i - 1][v], dp[i - 1][v - w[i]] + c[i]);
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int v = 1; v <= V; v++) {
			printf("%d ", dp[i][v]);
		}
		printf("\n");
	}
	system("pause");
	return 0;
}