磁力链接 网站怎么做的,肇庆企业建站程序,济南房地产信息网官网,织梦做的网站怎么加弹窗#x1f4d1;前言
本文主要是【算法】——蓝桥杯练习题#xff08;六#xff09;的文章#xff0c;如果有什么需要改进的地方还请大佬指出⛺️ #x1f3ac;作者简介#xff1a;大家好#xff0c;我是听风与他#x1f947; ☁️博客首页#xff1a;CSDN主页听风与他 …前言
本文主要是【算法】——蓝桥杯练习题六的文章如果有什么需要改进的地方还请大佬指出⛺️ 作者简介大家好我是听风与他 ☁️博客首页CSDN主页听风与他 每日一句狠狠沉淀顶峰相见 目录 前言172.递增三元组99.分巧克力1443.卡片2191.卡牌1372.美丽的区间文章末尾 172.递增三元组 import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.Arrays;public class Main {
/*
3
1 1 1
2 2 2
3 3 3
27*/public static void main(String[] args) throws IOException {// TODO Auto-generated method stubStreamTokenizer sc new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));sc.nextToken();int n (int)sc.nval;int a[] new int[n];int b[] new int[n];int c[] new int[n];for(int i0;in;i) {sc.nextToken();a[i] (int)sc.nval;}for(int i0;in;i) {sc.nextToken();b[i] (int)sc.nval;}for(int i0;in;i) {sc.nextToken();c[i] (int)sc.nval;}Arrays.sort(a);Arrays.sort(b);Arrays.sort(c);long sum 0;int i0,k0;for(int j0;jn;j) {while(ina[i]b[j]) i;while(knc[k]b[j]) k;sum(long)i*(n-k);}System.out.println(sum);}}
99.分巧克力
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;public class Main {static int[][] a;static int k;static int n;public static void main(String[] args) throws IOException {// TODO Auto-generated method stubStreamTokenizer sc new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));sc.nextToken();n (int)sc.nval;sc.nextToken();k (int)sc.nval;a new int[n][2];for(int i0;in;i) {sc.nextToken();a[i][0](int)sc.nval;sc.nextToken();a[i][1](int)sc.nval;}int l1,r(int)1e5;while(lr) {int mid (lr1)/2;if(check(mid)) {l mid;}else {r mid - 1;}}System.out.println(l);}public static boolean check(int x) {int sum0;for(int i0;in;i) {sum(a[i][0]/x)*(a[i][1]/x);}if(sumk) {return false;}return true;}}
1443.卡片 public class Main {static int a[];public static void main(String[] args) {// TODO Auto-generated method stuba new int[10];for(int i0;i10;i) {a[i] 2021;}int ans 1;while(f(ans)) {ans;}System.out.println(ans-1);}public static boolean f(int n) {while(n0) {a[n%10]--;if(a[n%10]0) {return false;}n/10;}return true;}
}
2191.卡牌 import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.Scanner;public class Main {static long a[];static long b[];static int n;static long m;public static void main(String[] args) throws IOException {// TODO Auto-generated method stubStreamTokenizer sc new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));sc.nextToken();n (int)sc.nval;sc.nextToken();m (long)sc.nval;a new long[ n];b new long[ n];for(int i0;in;i) {sc.nextToken();a[i](long)sc.nval;}for(int i0;in;i) {sc.nextToken();b[i](long)sc.nval;}int l0,r(int)4e5;while(lr) {//满足要求最大的int mid (lr1)/2;if(check(mid)) {l mid;}else {r mid - 1;}}System.out.println(l);}public static boolean check(int k) {int t0;for(int i0;in;i) {if(a[i]k) {if(k-a[i]b[i]) {return false;}else {tk-a[i];}}}if(tm) {return false;}return true;}
}
1372.美丽的区间 import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;public class Main {/*
5 6
1 2 3 4 5
2*/public static void main(String[] args) throws IOException {// TODO Auto-generated method stubStreamTokenizer sc new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));sc.nextToken();int n (int)sc.nval;sc.nextToken();int s (int)sc.nval;int a[] new int[n1];for(int i1;in;i) {sc.nextToken();a[i] (int)sc.nval;}long sum[] new long[n1];for(int i1;in;i) {sum[i] a[i]sum[i-1];}int min Integer.MAX_VALUE;for(int i1;in;i) {//固定左边界二分右边界int l i-1,rn;while(lr) {int mid (lr)/2;if(sum[mid]-sum[i-1]s) {r mid;}else {l mid 1;}}if(sum[r]-sum[i-1]s) {min Math.min(min, r-i1);}}if(minInteger.MAX_VALUE) {System.out.println(0);}else {System.out.println(min);}}}
文章末尾
