数学与简单DP

关注

原创最新推荐文章于 2026-04-20 09:46:49 发布 244 阅读 AI 写同款· GEO 优化 ›

蓝桥杯AcWing 题目题解 - 数学与简单DP AcWing 1230. K倍区间枚举 O(n3) 可以很简单的写出暴力代码，直接三重循环 for(int r = 1; r <= n; r ++) for(int l = 1; l <= r; l ++) { int sum = 0; for(int i = l; i <= r; i ++) sum += a[i]; if(sum % k == 0) ans ++; } 枚举左右... 阅读详情

数学与简单DP

在这里插入图片描述

import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int m = in.nextInt();
		System.out.println(n * m - n - m);
	}

}

在这里插入图片描述

import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int ans = n;
		while (n >= 3) {
			ans += n / 3;
			n = n / 3 + n % 3;
		}
		System.out.println(ans);
	}

}

在这里插入图片描述

import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int m = in.nextInt();
		int[] v = new int[n + 5];
		int[] w = new int[n + 5];
		int[] dp = new int[m + 5];
		for (int i = 0; i < n; i ++) {
			v[i] = in.nextInt();
			w[i] = in.nextInt();
		}
		for (int i = 0; i < n; i ++) {
			for (int j = m; j >= v[i]; j --) {
				dp[j] = Math.max(dp[j], dp[j - v[i]] + w[i]);
			}
		}
		System.out.println(dp[m]);
	}

}

在这里插入图片描述

import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		while (T -- > 0) {
			int n = in.nextInt();
			int m = in.nextInt();
			int[][] w = new int[n + 5][m + 5];
			for (int i = 1; i <= n; i ++) {
				for(int j = 1; j <= m; j ++) {
					w[i][j] = in.nextInt();
				}
			}
			int[][] dp = new int[n + 5][m + 5];
			for (int i = 1; i <= n; i ++) {
				for (int j = 1; j <= m; j ++) {
					dp[i][j] = Math.max(dp[i][j - 1], dp[i - 1][j]) + w[i][j];
				}
			}
			System.out.println(dp[n][m]);
		}
	}

}