第十四届蓝桥杯javac浅浅打卡一下

填空就不说了（反正错了）本文就不写解释了，等结果出来了再补一手吧

C：三国游戏

贪心

 

import java.io.*;
import java.util.Arrays;

/**
 * @ClassName 三国游戏
 * @Description TODO
 * @Author 小怂很怂
 * @Date 2023/4/8 13:40
 * @Version 1.0
 **/
public class 三国游戏 {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static StreamTokenizer st = new StreamTokenizer(br);
    static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));

    public static void main(String[] args) throws Exception {
        int n=nextInt();
        int []a=new int[n];
        int []b=new int[n];
        int []c=new int[n];
        for (int i=0;i=0;i--){
            sum+=a[i];
            ans+=b[i];
            count+=c[i];
            if (sum>0||ans>0||count>0) s=n-i;
        }
        pw.println(s);
        pw.flush();
    }

    public static int nextInt() throws Exception {//int型
        st.nextToken();
        return (int) st.nval;
    }

    public static long nextLong() throws Exception {//long型
        st.nextToken();
        return (long) st.nval;
    }
}

D：平均

贪心

 

import java.io.*;
import java.util.Arrays;

/**
 * @ClassName 平均
 * @Description TODO
 * @Author 小怂很怂
 * @Date 2023/4/8 13:46
 * @Version 1.0
 **/
public class 平均 {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static StreamTokenizer st = new StreamTokenizer(br);
    static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));

    public static void main(String[] args) throws Exception {
        int n=nextInt();
        int [][]f=new int[n][2];
        int []d=new int[10];
        for (int i=0;i{
            if (a[0]!=b[0]) return a[0]-b[0];
            return a[1]-b[1];
        }));
        long sum=0;
        for (int i=n-1;i>=0;i--){
            d[f[i][0]]++;
            if (d[f[i][0]]>n/10) sum+=f[i][1];
        }
        pw.println(sum);
        pw.flush();
    }

    public static int nextInt() throws Exception {//int型
        st.nextToken();
        return (int) st.nval;
    }

    public static long nextLong() throws Exception {//long型
        st.nextToken();
        return (long) st.nval;
    }
}

E：填充

贪心

import java.io.*;
import java.util.Scanner;

/**
 * @ClassName 填充
 * @Description TODO
 * @Author 小怂很怂
 * @Date 2023/4/8 13:54
 * @Version 1.0
 **/
public class 填充 {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static StreamTokenizer st = new StreamTokenizer(br);
    static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));

    public static void main(String[] args) throws Exception {
        Scanner sc=new Scanner(System.in);
        String ss=sc.nextLine();
        boolean []f=new boolean[ss.length()+1];
        int count=0;
        for (int i=1;i

 

F：棋盘

差分前缀和

数据范围：对于所有评测用例，1 ≤ n, m ≤ 2000 ，1 ≤ x1 ≤ x2 ≤ n ，1 ≤ y1 ≤ y2 ≤ m 。

import java.io.*;

/**
 * @ClassName 棋盘
 * @Description TODO
 * @Author 小怂很怂
 * @Date 2023/4/8 13:59
 * @Version 1.0
 **/
public class 棋盘 {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static StreamTokenizer st = new StreamTokenizer(br);
    static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));

    public static void main(String[] args) throws Exception {
        int n=nextInt();
        int m=nextInt();
        int [][]f=new int[n+2][n+2];
        for (int i=0;i

 

G：子矩阵

赛时代码忘记，暴力写的（1e9复杂度，5s不确定能不能过）

数据范围：对于所有评测用例，1 ≤ a ≤ n ≤ 1000 1 ≤ b ≤ m ≤ 1000 1 ≤ Ai, j ≤ 10^9 。

H：公因数匹配

一点点数学知识+贪心

import java.io.*;
import java.util.HashMap;
import java.util.Map;

/**
 * @ClassName 公因数匹配
 * @Description TODO
 * @Author 小怂很怂
 * @Date 2023/4/8 14:24
 * @Version 1.0
 **/
public class 公因数匹配 {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static StreamTokenizer st = new StreamTokenizer(br);
    static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));

    public static void main(String[] args) throws Exception {
        int n=nextInt();
        Map map=new HashMap<>();
        int min=99999999,max=0;
        int r=min,l=0;
        for (int i=0;i

I：异或和之差

暴力做的，代码忘了，应该是过40%数据

J：太阳

按照三角去判断的，按照高度排序然后一条一条往下判断，代码忘了，不确定对不对

祝各位看官姥爷都能省一进入决赛圈