二分与前缀和

关注

原创最新推荐文章于 2026-10-04 15:02:38 发布 287 阅读 AI 写同款· GEO 优化 ›

实战分享：如何用本地替换和插桩调试搞定Kasada最新版x-kpsdk-cd环境检测本文深入解析Kasada最新版x-kpsdk-cd环境检测机制，提供动态请求拦截、本地替换和函数插桩等实战调试策略。通过Proxy保护破解、关键函数断点调试和环境检测对抗方案，帮助逆向工程师有效应对从280位扩展到294位的加密数组挑战，实现高效补环境调试。阅读详情

二分与前缀和

在这里插入图片描述

import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int q = in.nextInt();
		int[] a = new int[n + 5];
		for (int i = 0; i < n; i ++) {
			a[i] = in.nextInt();
		}
		while (q -- > 0) {
			int x = in.nextInt();
			int l = 0, r = n - 1;
			while (l < r) {
				int mid = l + r >> 1;
				if (a[mid] >= x) r = mid;
				else l = mid + 1;
			}
			if (a[r] == x) {
				System.out.print(r);
				l = 0;
				r = n - 1;
				while (l < r) {
					int mid = l + r + 1 >> 1;
					if (a[mid] <= x) {
						l = mid;
					} else r = mid - 1;
				}
				System.out.println(" " + r);
				
			} else {
				System.out.println(-1 + " " + -1);
			}
		}
	}

}

在这里插入图片描述

import java.util.Scanner;

public class Main {
	
	static double eps = 1e-8;
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		double n = in.nextDouble();
		double l = -10000, r = 10000;
		while (r - l >= eps) {
			double mid = (l + r) / 2;
			if (mid * mid * mid >= n) r = mid;
			else l = mid;
		}
		System.out.println(String.format("%.6f", l));
	}

}

在这里插入图片描述

import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int T = in.nextInt();
		int[] arr = new int[n + 5];
		int[] sum = new int[n + 5];
		for (int i = 1; i <= n; i ++) {
			arr[i] = in.nextInt();
			sum[i] = sum[i - 1] + arr[i]; // 前缀和
		}
		while(T -- > 0) {
			int l = in.nextInt();
			int r = in.nextInt();
			System.out.println(sum[r] - sum[l - 1]); // 区间和
		}
		
	}

}

在这里插入图片描述

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 T = in.nextInt();
		int[][] arr = new int[n + 5][m + 5];
		int[][] sum = new int[n + 5][m + 5];
		for (int i = 1; i <= n; i ++) {
			for (int j = 1; j <= m; j ++) {
				arr[i][j] = in.nextInt();
				// 矩阵前缀和
				sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + arr[i][j]; 
			}
		}
		while(T -- > 0) {
			int x1 = in.nextInt();
			int y1 = in.nextInt();
			int x2 = in.nextInt();
			int y2 = in.nextInt();
			// 子矩阵和
			System.out.println(sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 - 1][y1 - 1]);
		}
		
	}

}