牛客周赛84 题解 Java ABCDEFG AK实录

多多*2025-03-17 18:46

目录

题目地址

做题情况

[A 题](#A 题)

[B 题](#B 题)

[C / D 题](#C / D 题)

[E 题](#E 题)

[F / G 题](#F / G 题)

题目地址

牛客竞赛_ACM/NOI/CSP/CCPC/ICPC算法编程高难度练习赛_牛客竞赛OJ

做题情况

A 题

复制代码 
import java.io.*;
import java.math.*;
import java.util.*;

// xixi♡西
public class Main {
    static IOS sc=new IOS();
    
	static void solve() throws IOException {
    	
		int a1=sc.nextInt();
		int a2=sc.nextInt();
		int a3=sc.nextInt();
		
		dduoln(Math.abs(a1-a2)+Math.abs(a2-a3)==0?"Yes":"No");
		
    } 
    
    
    public static void main(String[] args) throws Exception {
        int t = 1;
//        t = sc.nextInt();
        while (t-- > 0) {solve();}
    }
    
    static <T> void dduo(T t) {System.out.print(t);}
    static <T> void dduoln(T t) {System.out.println(t);}

}

class IOS{
    BufferedReader bf;
    StringTokenizer st;
    BufferedWriter bw;
    public IOS(){
        bf=new BufferedReader(new InputStreamReader(System.in));
        st=new StringTokenizer("");
        bw=new BufferedWriter(new OutputStreamWriter(System.out));
    }
    public String nextLine() throws IOException{
        return bf.readLine();
    }
    public String next() throws IOException{
        while(!st.hasMoreTokens()){
            st=new StringTokenizer(bf.readLine());
        }
        return st.nextToken();
    }
    public char nextChar() throws IOException{
        return next().charAt(0);
    }
    public int nextInt() throws IOException{
        return Integer.parseInt(next());
    }
    public long nextLong() throws IOException{
        return Long.parseLong(next());
    }
    public double nextDouble() throws IOException{
        return Double.parseDouble(next());
    }
    public float nextFloat() throws IOException{
        return Float.parseFloat(next());
    }
    public BigInteger nextBigInteger() throws IOException{
        return new BigInteger(next());
    }
    public BigDecimal nextDecimal() throws IOException{
        return new BigDecimal(next());
    }
}

B 题

复制代码 
import java.io.*;
import java.math.*;
import java.util.*;

// xixi♡西
public class Main {
    static IOS sc=new IOS();
    
	static void solve() throws IOException {
    	
		int n=sc.nextInt();
		
		int arr[]=new int[n];
		
		HashMap< Integer , Integer >hm=new HashMap<>();
		
		for(int i=0;i<n;i++) {
			arr[i]=sc.nextInt();
			hm.put(arr[i], hm.getOrDefault(arr[i], 0)+1);
		}
		
		Arrays.sort(arr);
		
		int cnt=0;
		
		for(int i=0;i<n-1;i++) {
			cnt+=Math.abs(arr[i]-arr[i+1]);
		}
		
		if(hm.size()==1) {
			dduoln("1 "+cnt);
		}else {
			dduoln("2 "+cnt);
		}
		
		
    } 
    
    
    public static void main(String[] args) throws Exception {
        int t = 1;
//        t = sc.nextInt();
        while (t-- > 0) {solve();}
    }
    
    static <T> void dduo(T t) {System.out.print(t);}
    static <T> void dduoln(T t) {System.out.println(t);}

}

class IOS{
    BufferedReader bf;
    StringTokenizer st;
    BufferedWriter bw;
    public IOS(){
        bf=new BufferedReader(new InputStreamReader(System.in));
        st=new StringTokenizer("");
        bw=new BufferedWriter(new OutputStreamWriter(System.out));
    }
    public String nextLine() throws IOException{
        return bf.readLine();
    }
    public String next() throws IOException{
        while(!st.hasMoreTokens()){
            st=new StringTokenizer(bf.readLine());
        }
        return st.nextToken();
    }
    public char nextChar() throws IOException{
        return next().charAt(0);
    }
    public int nextInt() throws IOException{
        return Integer.parseInt(next());
    }
    public long nextLong() throws IOException{
        return Long.parseLong(next());
    }
    public double nextDouble() throws IOException{
        return Double.parseDouble(next());
    }
    public float nextFloat() throws IOException{
        return Float.parseFloat(next());
    }
    public BigInteger nextBigInteger() throws IOException{
        return new BigInteger(next());
    }
    public BigDecimal nextDecimal() throws IOException{
        return new BigDecimal(next());
    }
}

C / D 题

复制代码 
import java.io.*;
import java.math.*;
import java.util.*;

// xixi♡西
public class Main {
    static IOS sc=new IOS();
    
	static void solve() throws IOException {
    	
		int n=sc.nextInt();
		
		int k=sc.nextInt();

		String str=sc.next();
		
		long arr[]=new long[n-1];
		for(int i=0;i<n-1;i++) {
			arr[i]=Math.abs(str.charAt(i+1)-str.charAt(i));
		}
		
		long ans=0;
		
		// 双指针
		int i=0;
		int j=n-2;
		
		long a=1;
		
		long cnt=0;
		
		if(k>n/2) {
			k=n-k+1;
		}else {
			k--;
		}
		
		while(i<=j) {
//			dduoln(a);
			if(i==j) {
				cnt+=arr[i]*a;
			}else {
				cnt+=arr[i]*a;
				cnt+=arr[j]*a;	
			}
			if(a<k) {
				a++;
			}
			i++;
			j--;
		}
		
		dduoln(cnt);
		
    } 
    
    
    public static void main(String[] args) throws Exception {
        int t = 1;
//        t = sc.nextInt();
        while (t-- > 0) {solve();}
    }
    
    static <T> void dduo(T t) {System.out.print(t);}
    static <T> void dduoln(T t) {System.out.println(t);}

}

class IOS{
    BufferedReader bf;
    StringTokenizer st;
    BufferedWriter bw;
    public IOS(){
        bf=new BufferedReader(new InputStreamReader(System.in));
        st=new StringTokenizer("");
        bw=new BufferedWriter(new OutputStreamWriter(System.out));
    }
    public String nextLine() throws IOException{
        return bf.readLine();
    }
    public String next() throws IOException{
        while(!st.hasMoreTokens()){
            st=new StringTokenizer(bf.readLine());
        }
        return st.nextToken();
    }
    public char nextChar() throws IOException{
        return next().charAt(0);
    }
    public int nextInt() throws IOException{
        return Integer.parseInt(next());
    }
    public long nextLong() throws IOException{
        return Long.parseLong(next());
    }
    public double nextDouble() throws IOException{
        return Double.parseDouble(next());
    }
    public float nextFloat() throws IOException{
        return Float.parseFloat(next());
    }
    public BigInteger nextBigInteger() throws IOException{
        return new BigInteger(next());
    }
    public BigDecimal nextDecimal() throws IOException{
        return new BigDecimal(next());
    }
}

E 题

复制代码 
import java.io.*;
import java.math.*;
import java.util.*;

// xixi♡西
public class Main {

    static IoScanner sc = new IoScanner();
    static int MOD=(int) (1e9+7);
    
    static ArrayList< ArrayList<Integer> > list;
    static long dp[]; // 当前节点往下的陡峭值
    static int father[]; // 当前节点父节点的值
    
    
	static void solve() throws IOException {
		
		int n=sc.nextInt();
		list = new ArrayList<>();
		
		for(int i=0;i<n+5;i++) {
			list.add(new ArrayList<>());
		}
		
		for(int i=0;i<n-1;i++) {
			int u=sc.nextInt();
			int v=sc.nextInt();
			list.get(u).add(v);
			list.get(v).add(u);
		}
		
		dp=new long[n+1];
		father=new int[n+1];
		
		dfs(1,0);
		
		long min=Long.MAX_VALUE;
		for(int i=2;i<=n;i++) {
			long t1=dp[i];
			long t2=dp[1]-dp[i]-Math.abs(i-father[i]);
			min=Math.min(min, Math.abs(t1-t2));
		}
		dduoln(min);
		
    } 
	
	/**
	 * 
	 * @param u 当前节点
	 * @param p 父节点
	 */
	static void dfs(int u,int p) {
		father[u]=p;
		for(int v:list.get(u)) { // v 相邻节点
			if(v==p)continue;
			dfs(v,u);
			dp[u]+= Math.abs(u-v) + dp[v];
		}
	}
    
    
    public static void main(String[] args) throws Exception {

        int t = 1;
//        t = sc.nextInt();
        while (t-- > 0) {
            solve();
        }
    }

    static <T> void dduo(T t){System.out.print(t);}
    static <T> void dduoln(){System.out.println("");}
    static <T> void dduoln(T t){System.out.println(t);}
    
}

class IoScanner {
    BufferedReader bf;
    StringTokenizer st;
    BufferedWriter bw;

    public IoScanner() {
        bf = new BufferedReader(new InputStreamReader(System.in));
        st = new StringTokenizer("");
        bw = new BufferedWriter(new OutputStreamWriter(System.out));
    }

    public String nextLine() throws IOException {
        return bf.readLine();
    }

    public String next() throws IOException {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(bf.readLine());
        }
        return st.nextToken();
    }

    public char nextChar() throws IOException {
        return next().charAt(0);
    }

    public int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    public long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    public double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    public float nextFloat() throws IOException {
        return Float.parseFloat(next());
    }

    public BigInteger nextBigInteger() throws IOException {
        return new BigInteger(next());
    }

    public BigDecimal nextDecimal() throws IOException {
        return new BigDecimal(next());
    }
}

F / G 题

复制代码 
import java.io.*;
import java.math.*;
import java.util.*;

// xixi♡西
public class Main {

    static IoScanner sc = new IoScanner();
    static final int mod=(int) (1e9+7);
    
	static void solve() throws IOException {
    	
		int n=sc.nextInt();
		long a[]=new long[n];
		
        for(int i=0;i<n;i++){
            a[i]=sc.nextLong();
        }
        
        Arrays.sort(a);
        
        long ans=0,sum=0;
        for(int i=0;i<n;i++){
            ans+=a[i]*i-sum;
            sum+=a[i];
            ans%=mod;
            sum%=mod;
        }
        
        long fenzi=ans%mod*2%mod;
        long fenmu=n%mod;
		
        dduoln(fenzi%mod*pow(fenmu,mod-2,mod)%mod);
		
    } 
    
    // 计算 q 在模 MOD 下的逆元 
    public static long modInverse(long q) { 
        return pow(q, mod - 2, mod); 
    } 
 
    // 快速幂取模函数 
    public static long pow(long base, long exponent, long mod) { 
    	long result = 1; 
        base = base % mod; 
        while (exponent > 0) { 
            if ((exponent & 1) == 1) { 
                result =(long)((long) result * base % mod); 
            } 
            exponent = exponent >> 1; 
            base = (long) ((long) base * base % mod); 
        } 
        return result; 
    } 
    
    public static void main(String[] args) throws Exception {

        int t = 1;
//        t = sc.nextInt();
        while (t-- > 0) {
            solve();
        }
    }

    static <T> void dduo(T t){System.out.print(t);}
    static <T> void dduoln(){System.out.println("");}
    static <T> void dduoln(T t){System.out.println(t);}
    
}

class IoScanner {
    BufferedReader bf;
    StringTokenizer st;
    BufferedWriter bw;

    public IoScanner() {
        bf = new BufferedReader(new InputStreamReader(System.in));
        st = new StringTokenizer("");
        bw = new BufferedWriter(new OutputStreamWriter(System.out));
    }

    public String nextLine() throws IOException {
        return bf.readLine();
    }

    public String next() throws IOException {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(bf.readLine());
        }
        return st.nextToken();
    }

    public char nextChar() throws IOException {
        return next().charAt(0);
    }

    public int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    public long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    public double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    public float nextFloat() throws IOException {
        return Float.parseFloat(next());
    }

    public BigInteger nextBigInteger() throws IOException {
        return new BigInteger(next());
    }

    public BigDecimal nextDecimal() throws IOException {
        return new BigDecimal(next());
    }
}
相关推荐
极限实验室43 分钟前
使用 INFINI Gateway 保护 Elasticsearch 集群之修改查询不合理参数（二）
数据库
竹杖芒鞋轻胜马，谁怕？一蓑烟雨任平生。1 小时前
etcd客户化工具
数据库·etcd
谷晓光1 小时前
python中print函数的flush如何使用
linux·服务器·数据库
Mountain and sea1 小时前
于 Hexo + GitHub Pages 的搭建个人博客网站的详细教程
github
OceanBase数据库官方博客1 小时前
自然语言秒转SQL—— 免费体验 OB Cloud Text2SQL 数据查询
数据库·sql·ai·oceanbase·分布式数据库·向量·text2sql
Stark、1 小时前
【MySQL】多表查询（笛卡尔积现象，联合查询、内连接、左外连接、右外连接、子查询）-通过练习快速掌握法
数据库·后端·sql·mysql
yqcoder1 小时前
Redis 的应用场景
数据库·redis·缓存
申未曲1 小时前
如何解决Redis的缓存雪崩、缓存击穿、缓存穿透？
redis·缓存·mybatis
kngines2 小时前
【实战ES】实战 Elasticsearch：快速上手与深度实践-8.2.2成本优化与冷热数据分离
大数据·数据库·elasticsearch·搜索引擎
Aiden Targaryen2 小时前
Mac 使用 Crossover 加载 Windows Steam 游戏库，实现 Windows/Mac 共享移动硬盘
游戏·macos
热门推荐
01本地化部署AI知识库：基于Ollama+DeepSeek+AnythingLLM保姆级教程02如何在WPS和Word/Excel中直接使用DeepSeek功能03DeepSeek各版本说明与优缺点分析04从零安装 LLaMA-Factory 微调 Qwen 大模型成功及所有的坑05DeepSeek RAGFlow构建本地知识库系统06本地部署DeepSeek教程（Mac版本）07命令行方式将mysql数据库迁移到达梦数据库（全步骤）08如何本地部署AI智能体平台，带你手搓一个AI Agent09DeepSeek R1本地化部署 Ollama + Chatbox 打造最强 AI 工具10rv1126交叉编译opencv+ffmpeg+x264