olone

分类

/ 注册

全部文章（共65篇）

题解 | Poi 的新加法（Easy Version）

#include<bits/stdc++.h> using namespace std; typedef long long LL; const int N = 1e6 + 5; int T; int n, q; LL a[N]; inline void solve(){ ...

2026-04-26

0 13

题解 | 小苯的01背包（easy）

#include<bits/stdc++.h> using namespace std; const int N = 2e3 + 5; int n, k; int v[N], w[N]; int f[N]; bool vis[N][N]; vector<int> V...

2026-04-25

0 12

题解 | 最大稳定数值

#include<bits/stdc++.h> using namespace std; typedef long long LL; const int N = 1e5 + 5; int n; int a[N]; LL prefix[N]; bool is_support[N], ...

2026-04-22

0 18

题解 | 穷哈哈~

import java.util.Scanner; public class Main{ static Scanner in = new Scanner(System.in); public static void main(String[] args){ int ...

2026-04-20

0 16

题解 | 小红的完全二叉树构造

import java.util.*; public class Main{ static Scanner in = new Scanner(System.in); public static void main(String[] args){ int n = in...

2026-04-19

0 17

题解 | 分元宵

import java.util.Scanner; public class Main{ static Scanner in = new Scanner(System.in); static long mod; public static long qpower(long...

2026-04-17

0 16

题解 | 数独数组

import java.util.Scanner; public class Main{ static Scanner in = new Scanner(System.in); public static void main(String[] args){ int ...

2026-04-15

0 24

题解 | 元素方碑

import java.util.Scanner; public class Main{ static Scanner in = new Scanner(System.in); public static void solve(){ int n = in.ne...

2026-04-13

0 26

题解 | 抽卡

import java.util.*; public class Main{ static final long mod = 1000000007; static long qpower(long x, long y){ long res = 1; ...

2026-04-08

1 43

题解 | 树上行走

import java.util.Scanner; public class Main{ static final int N = 200005; static int[] a = new int[N]; static int[] head = new int[N<&...

2026-04-04

1 38