qq_45908682的博客

import java.util.*;public class Main{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); int n = scan.nextInt(); Deque<Integer> deque = new ArrayDeque(); while(n -...

希望多学学早日能做出来 dp的题好朴素 三层forimport java.util.*;public class Main{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int v = scan.nextInt(); int[] a ..

这个大佬讲的很好！AcWing 2. 01背包-打印dp理解用一维数组为何要逆序更新 - AcWingimport java.util.*;public class Main{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int v = scan.nextInt();..

1.背包问题1）01背包问题import java.util.*;public class Main{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int v = scan.nextInt(); int[] a = new int[n + 1.

import java.util.*;public class Main{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int[][] a = new int[n][2]; for(int i = 0 ;i < n; i++){ a[...

import java.util.*;// 存储add中的x, c; query中的l, rclass Pair { int x, y; Pair(int x, int y) { this.x = x; this.y = y; }}public class Main { public static void main(String[] args) { List<Pair> a...

位运算呜呜呜呜import java.util.*;public class Main{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); int n = scan.nextInt(); while(n -- > 0){ int tmp = scan.nextInt(); int .

y总yyds喵喵喵喵啊import java.util.*;public class Main{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int m = scan.nextInt(); int[] a = new int[n]; int[] b

双指针yyds简单题重拳出击import java.util.*;public class Main{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int m = scan.nextInt(); int x = scan.nextInt();

总是写错 谢谢y老师谢谢题解大哥 双指针yydsimport java.util.*;public class Main{ private static int N = 100010; private static int[] a = new int[N]; private static int[] s = new int[N]; public static void main(String[] args){ i...

我效率好低 是不是太笨了 希望理解力upupup谢谢y老师和徐老师❤️切接 close()，不然过不了import java.util.*;public class Main{ private static int N = 1010; public static void main(String[] args){ Scanner scan = new Scanner(System.in); int n = scan.n..

“差分就是前缀和的逆运算”早上起来和y老师约会❤️import java.util.*;public class Main{ private static int N = 100010; public static void main(String[] args){ Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int m = sc

继续感谢徐老师和y老师❤️二维数组的前缀和import java.util.*; public class Main{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int m = scan.nextInt(); int q = scan.ne

感谢y老师和徐老师❤️第一次不是照着题解敲的算法基础课希望我早日变强 offer多多多多多多多多多多多多import java.util.*;public class Main{ private static int N = 10010; public static void main(String[] args){ Scanner scan = new Scanner(System.in); int m = scan.n

和y总频繁约会嘿嘿 ❤️冲冲冲 加油import java.util.*;public class Main{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); String a =scan.next(); int b = scan.nextInt(); int[] A = new int[a.length()];

java:又是听懂课不会写照着大佬代码写一遍的一天import java.util.*;public class Main{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); String a = scan.nextLine(); int b = scan.nextInt(); List<Inte

java:好难呜呜呜呜import java.util.*;public class Main { // 判断是否有 A >= B public static boolean cmp(List<Integer> A, List<Integer> B) { if (A.size() != B.size()) return A.size() > B.size(); for (int i = A.size() - 1; i

学习一下高精度计算系列y总好帅爱了爱了有输入输出import java.util.*;public class Main{ public static String sum(List<Integer> a,List<Integer> b) { int[] c = new int[100010]; int t = 0,i; for(i = 0;i < a.size() || i < b.size();

和y总约会 哈哈哈哈java:import java.util.*;public class Main{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); double target = scan.nextDouble(); double l = -10000, r = 10000;

这个题好难啊 救命 呜呜呜 二分好难java：import java.util.*;public class Main{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int q = scan.nextInt(); int[] arr = new

同leetcode剑指 Offer 51. 数组中的逆序对谢谢y老师学到了 哈哈哈爱了java：import java.util.*;public class Main{ private static int N = 100010; private static int[] q = new int[N]; private static int[] tmp = new int[N]; public static void main(String[].

学习ing继续输入输出冲冲冲java：import java.util.*;public class Main{ private static int N = 100010; private static int[] q = new int[N]; private static int[] tmp = new int[N]; public static void main(String[] args){ Scanner scan = new

1.快速排序public static void quicksort(int[] q, int l, int r){ if (l >= r){ return; } int x = q[l + r >> 1]; int i = l - 1; int j = r + 1; while(i < j){ do i ++; wh

复习一下快排 学习一下输入输出呜呜呜加油import java.util.*;public class Main{ private static int N = 100010; private static int[] q = new int[N]; public static void main(String[] args){ Scanner scan = new Scanner(System.in); int n = scan.n

谢谢y老师模版和大佬们题解❤️年轻y总好帅爱了爱了❤️有输入输出版😄java:import java.util.*;public class Main{ private static int N = 100010; private static int[] q = new int[N]; public static void main(String[] args){ Scanner scanner = new Scanner(System.in)