第十四届蓝桥杯三月真题刷题训练——第 27 天

储物点的距离

原题链接

储物点的距离

解题思路

前缀和

参考代码

todo：这里是参考代码

数学考试

原题链接

数学考试

解题思路

前缀和
定义 pre[i] 为 [1, i] 中长度为 k 的区间和的最大值，suf[i] 为 [i, n] 中长度为 k 的区间和的最大值
显然 pre[k] = sum(a[1: k]) pre[k + 1] = max(pre[k], sum(a[2:k+1]))…
这里的 sum(a[1: k]) 是指 a[1] + a[2] + … + a[k]，这一步可以通过前缀和直接得到
suf[i] 同理

参考代码

import java.util.*;
import java.math.*;
import java.io.*;

public class Main {

    static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    // static StreamTokenizer st = new StreamTokenizer(in);
    static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    
    static long INF = Long.MIN_VALUE;
    public static void main(String[] args) throws Exception {
    	int t = Integer.parseInt(in.readLine());
    	while (t-- > 0) {
    		String[] nk = in.readLine().split(" ");
    		int n = Integer.parseInt(nk[0]), k = Integer.parseInt(nk[1]);
    		long[] a = new long[n + 1];
    		String[] ss = in.readLine().split(" ");
    		long[] pre = new long[n + 1], suf = new long[n + 1];
    		Arrays.fill(pre, INF);
    		Arrays.fill(suf, INF);
    		for (int i = 1; i <= n; i++) {
    			a[i] = Integer.parseInt(ss[i - 1]);
    			a[i] += a[i - 1];
    		}
    		for (int i = k; i <= n; i++) {
    			pre[i] = Math.max(pre[i - 1], a[i] - a[i - k]);
    		}
    		
    		for (int i = n - k + 1; i >= k + 1; i--) {
    			suf[i] = Math.max(suf[i + 1], a[i + k - 1] - a[i - 1]);
    		}
    		long ans = INF;
    		for (int i = k; i <= n - k; i++) {
    			ans = Math.max(ans, pre[i] + suf[i + 1]);
    		}
    		out.println(ans);
    		
    	}

        out.flush();
        in.close();
    }  
}

地标访问

原题链接

地标访问

解题思路

二分答案

参考代码

todo：这里是参考代码

木材

原题链接

木材

解题思路

二分答案

参考代码

import java.util.*;
import java.math.*;
import java.io.*;

public class Main {

    static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    // static StreamTokenizer st = new StreamTokenizer(in);
    static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    
    static int N = (int)2e5 + 10, n;
    static long[] h = new long[N], a = new long[N];
    static long s, l;
    
    public static boolean check(long x) {
    	long sum = s;
    	for (int i = 0; i < n; i++) {
    		if (h[i] + x * a[i] >= l) sum -= h[i] + x * a[i];
    		if (sum <= 0) return true;
    	}
    	return false;
    }

    public static void main(String[] args) throws Exception {
    	String[] ss = in.readLine().split(" ");
    	n = Integer.parseInt(ss[0]);
    	s = Long.parseLong(ss[1]);
    	l = Long.parseLong(ss[2]);
    	ss = in.readLine().split(" ");
    	for (int i = 0; i < n; i++) {
    		h[i] = Long.parseLong(ss[i]);
    	}
    	long left = 0, right = Math.max(s, l);
    	ss = in.readLine().split(" ");
    	for (int i = 0; i < n; i++) {
    		a[i] = Long.parseLong(ss[i]);
    		right = Math.max(right, (s - h[i]) / a[i] + 1);
    	}
    	
    	while (left < right) {
    		long mid = left + ((right - left) >> 1);
    		if (check(mid)) {
    			right = mid;
    		} else {
    			left = mid + 1;
    		}
    	}
    	out.println(left);

        out.flush();
        in.close();
    }  
}