暂时未有相关云产品技术能力~
暂无个人介绍
Codeforces 1312E. Array Shrinking(区间DP 栈)
AtCoder Beginner Contest 223 D - Restricted Permutation(建图 思维 构造 拓扑排序)
【安卓开发】ArrayAdapter requires the resource ID to be a TextView
【安卓开发】Android studio真机测试时Logcat无输出
Codeforces Round #748 (Div. 3) F - Red-Black Number (记忆化搜索)
Codeforces Round #748 (Div. 3) D2. Half of Same(数学 枚举 思维)
Codeforces Round #748 (Div. 3) E. Gardener and Tree(拓扑排序)
Educational Codeforces Round 115 (Rated for Div. 2) D. Training Session(组合数学 思维)
AtCoder Beginner Contest 221 E - LEQ(组合数学 树状数组)
ICPC North Central NA Contest 2018 G . Tima goes to Xentopia(最短路 空间优化 剪枝)
ICPC North Central NA Contest 2018 C . Rational Ratio(结论 模拟 gcd)
Codeforces Round #747 (Div. 2) D. The Number of Imposters(扩展域并查集 带权并查集)
AtCoder Beginner Contest 222 E - Red and Blue Tree(dfs dp)
AcWing 第 20 场周赛 3995. 最小的和(贪心 优先队列)
AtCoder Beginner Contest 222 D - Between Two Arrays(前缀和优化dp)
PAT (Advanced Level) Practice 1044 Shopping in Mars (前缀和 二分)
【安卓开发】借助setOnItemClickListener动态更新Listview
【安卓开发】‘boolean java.util.List.add(java.lang.Object)‘ on a null object
NWERC2019 Canvas Line(贪心)
Codeforces Round #746 (Div. 2) D - Hemose in ICPC ?(交互 二分 欧拉序)
CF898D. Alarm Clock(贪心 双指针)
Codeforces Round #746 (Div. 2) C - Bakry and Partitioning(dfs 异或技巧 思维)
牛客练习赛60 C操作集锦(dp 去重)
luoguP2205 [USACO13JAN]Painting the Fence S(差分 扫描线思想)
AtCoder Beginner Contest 221 D - Online games(差分 离散化 区间)
SEERC 2018 H - Modern Djinn (随机化)
2021牛客国庆集训派对day1E Removal(dp 去重)
2021牛客国庆集训派对day1 J.Different Integers(莫队)
CF761D Dasha and Very Difficult Problem(构造 思维)
CF1398C. Good Subarrays(思维 前缀和)
CF1169C. Increasing by Modulo(二分)
CF817C.Really Big Numbers(二分 思维)
CF709D. Recover the String(构造)
CF1573B. Swaps(思维)
CF1573C. Book(拓扑排序 最长路)
CF979B Treasure Hunt(贪心 思维)
AcWing 第 15 场周赛 3827. 最小正整数(思维)
2020ICPC济南站 A . Matrix Equation (高斯消元)
HDU3915 Game (高斯消元求自由元个数)
HDU5088 Revenge of Nim II(高斯消元求自由元个数 Nim博弈)
【安卓开发】天气预报app的UI界面(包含全部代码)
【安卓开发】AndroidStudio添加依赖
UCF 2021 Practice F.Balanced Strings (思维 组合数学)
CF834D. The Bakery(线段树优化dp 决策单调性优化dp)
CF960F. Pathwalks (树上二维LIS 线段树 动态开点树状数组)
CF507E Breaking Good (多关键字最短路 路径还原)
German Collegiate Programming Contest 2019 H . Historical Maths (二分 大数)
German Collegiate Programming Contest 2019 B . Bouldering (最短路)
AtCoder Beginner Contest 218 F - Blocked Roads (最短路径还原 思维)
AtCoder Beginner Contest 218 C - Shapes (模拟)