测试次数（蓝桥杯18D）----动态规划

#include<iostream>
#define N 10001
using namespace std;
int dp[4][N];
int main(){
	int n = 1000;
	for (int i = 1; i <= 3; i++) {
		for (int j = 0; j <= n;j++) {
			dp[i][j] = j;
		}
	}
	for (int i = 2; i <= 3;i++) {
		for (int j = 2; j <= n;j++) {
			for (int k = 1; k <= j;k++) {
				dp[i][j] = min(dp[i][j],max(dp[i-1][k-1],dp[i][j-k])+1);
			}
		}
	}
	cout << dp[3][n];
	return 0;
}