Codeforces 494Div3（ABCDJava编写）

Codeforces 494 div3 (ABCD)

从暑假开始做cf，感觉cf的题目很好，div3难度正好也挺适合我这种垃圾的。题目链接
A：要找分割的最小次数，其实就是求同一个元素出现的最大次数。用hashmap即可。

package codeforces494;import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;public class codeA {public static void main(String[] args) {Scanner sc=new Scanner(System.in);int n=sc.nextInt();Map <Integer,Integer>map=new HashMap();int max=1;for(int i=0;i<n;i++){int j=sc.nextInt();if(map.containsKey(j)) {map.put(j, map.get(j)+1);if(map.get(j)>max) {max=map.get(j);}}else{map.put(j, 1);}}System.out.println(max);}
}

B：要求写出一种满足要求数量的01不同的策略。贪心，分奇偶讨论。一个为整，一个插入就行。

package codeforces494;import java.util.Scanner;public class codeB {public static void main(String[] args) {Scanner sc=new Scanner(System.in);int a=sc.nextInt();//a个0int b=sc.nextInt();int x=sc.nextInt();//x个StringBuffer bu=new StringBuffer("");for(int i=0;i<a;i++){bu.append("0");}String s=bu.toString();StringBuffer bu2=new StringBuffer("");for(int i=0;i<b;i++){bu2.append("1");}String s2=bu2.toString();if(s.length()<s2.length()){String team=s;s=s2;s2=team;a=b;}if(x%2==0)//偶数{int team=x;if(x>2){while(team>2){s=s.substring(0,a-1-(x-team)/2)+s2.substring(0,1)+s.substring(a-1-(x-team)/2);s2=s2.substring(1);team=team-2;}  s=s.substring(0,a-1-(x-team)/2)+s2+s.substring(a-1-(x-team)/2);}else{s=s.substring(0,1)+s2+s.substring(1);}}else{int team=x;while(team>1){s=s.substring(0,a-1-(x-team)/2)+s2.substring(0,1)+s.substring(a-1-(x-team)/2);s2=s2.substring(1);team=team-2;}s+=s2;}System.out.println(s);}
}

C：求子数列的最大平均值，用dp。

package codeforces494;import java.util.Scanner;public class codeC {public static void main(String[] args) {Scanner sc=new Scanner(System.in);double max=0.0;int n=sc.nextInt();//总个数int k=sc.nextInt();int a[]=new int[(int) n];for(int i=0;i<n;i++){a[i]=sc.nextInt();}int dp[][]=new int [n+1][n];//长度为k,第n个数截至的总和///计算长度为1到长度为k的for(int i=0;i<n;i++){dp[1][i]=a[i];}for(int i=2;i<n+1;i++){for(int j=i-1;j<n;j++){dp[i][j]=dp[i-1][j-1]+a[j];if(i>=k){if((double)dp[i][j]/i>max){max=(double)dp[i][j]/i;}}}}if(k==1){for(int i=0;i<n;i++){if(a[i]>max){max=a[i];}}}
//        for(int i=0;i<n;i++)
//        {//          System.out.print(dp[4][i]+" ");
//        }System.out.println(max);}
}

D：

package codeforces494;import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.HashMap;
import java.util.Map;public class codeD {public static void main(String[] args) throws IOException {StreamTokenizer in=new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));Map<Long,Integer> map=new HashMap();in.nextToken();int n=(int)in.nval;in.nextToken();int q=(int)in.nval;long value[]=new long[33];//价值输入int number[]=new int[33];value[0]=1;map.put((long) 1, 0);for(int i=1;i<33;i++){value[i]=2*value[i-1];map.put( value[i], i);//System.out.println(value[i]);}     for(int i=0;i<n;i++){in.nextToken();long input=(long)in.nval;int getint=map.get(input);number[getint]++;}int t=31;int count=0;while(q-->0){in.nextToken();int sea=(int)in.nval; count=0;for(int i=t;i>=0;i--){int num=number[i];if(sea<value[i]||num==0) {continue;}else  if(sea>=value[i]&&num>0) {int numb1=(int) (sea/value[i]); numb1=numb1>num?num:numb1;sea-=value[i]*numb1;count+=numb1;                                          }else if(sea==0) {break;}}if(sea==0){System.out.println(count);}else{System.out.println(-1);}           }}
}

Codeforces 494Div3（ABCDJava编写）相关推荐

解题报告（十八）数论题目泛做（Codeforces 难度：2000 ~ 3000 + ）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划繁凡出品的全新系列:解题报告系列 -- 超高质量算法题单,配套我写的超高质量的题解和代码,题目难度不一 ...
Codeforces Round #696 (Div. 2) （A ~ E）超高质量题解（每日训练 Day.16 ）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Codeforces Round #696 (Div. 2) (A ~ E)超高质量题解比赛链接:h ...
Codeforces Round #734 (Div. 3) 题解
Hello大家好,今天给大家带来的是 Codeforces Round #734 (Div. 3) 的全题目讲解. 本文链接:https://www.lanqiao.cn/questions/2040 ...
CodeForces - 798B Mike and strings
B. Mike and strings time limit per test2 seconds memory limit per test256 megabytes inputstandard in ...
codeforces beta round 1
codeforces beta round 1 A Theatre Square in the capital city of Berland has a rectangular shape with ...
[codeforces 1379B] Dubious Cyrpto 公式推导
Codeforces Round #657 (Div. 2) 参与排名人数8684 错过了难得17:00比赛,可惜 [codeforces 1379B] Dubious Cyrpto 公 ...
Codeforces与洛谷题目之间跳转油猴插件
title: Codeforces与洛谷题目之间跳转油猴插件 date: 2023-05-04 15:32:39 categories: 其他 tags: 油猴脚本 Codeforces与洛谷题目之间 ...
Codeforces Round #636 (Div. 3)部分题解
链接:Codeforces Round #636 (Div. 3) A - Candies 题意:求出一个x满足x+2∗x+4∗x+⋯+2k−1∗x=n且k>1 思路:提出x得x∗(1+2+4+ ...
[codeforces 1364B] Most socially-distanced subsequence 绝对值脱壳的4种形态
Codeforces Round #649 (Div. 2) 参与排名人数11286 [codeforces 1364B] Most socially-distanced subsequence ...

Codeforces 494Div3（ABCDJava编写）

Codeforces 494 div3 (ABCD)

Codeforces 494Div3（ABCDJava编写）相关推荐

最新文章

热门文章