摘要：
我的B站主页：https://space.bilibili.com/611212 我的微信公众号：QSC的算法讲堂 我的QQ群：728615719 我的知乎：qscqesze 【背景】 我已经毕业两年了，正所谓金三银四，现在正是刷题跳槽的好时节。 上周同组的兄弟也讲了一下做自媒体的好处，所以我也开始 阅读全文
摘要：
我是qscqesze，大家可以叫我qsc 名字是随便乱打出来的，如果强行说一个理由的话：这几个字符在键盘上是一个X形状。 更新，现在更清楚了自己的定位，变成了推荐架构工程师了，专注于推荐底层开发。 // 现在是一名算法工程师，机器学习方向，工作日常是洗数据。 // 每天都在思考自己为什么还没被公司开 阅读全文
摘要：
一款将象形汉字同 Wordle 猜测结合起来的猜成语小游戏 ——《词影》 目前还在内测中，欢迎大家试玩，还望各位拍砖 Orz 游戏关键词 类 wordle 象形文字 每天十局 体验地址 扫描下方二维码，或者打开链接 https://cy.surprising.studio 即可体验 阅读全文
摘要：
B. Glass Half Spilled There are 𝑛 glasses on the table numbered 1,…,𝑛. The glass 𝑖 can hold up to 𝑎𝑖 units of water, and currently contains 𝑏𝑖 阅读全文
摘要：
E. Plan of Lectures Ivan is a programming teacher. During the academic year, he plans to give 𝑛 lectures on 𝑛 different topics. Each topic should be 阅读全文
摘要：
E. Water Level In recent years John has very successfully settled at his new job at the office. But John doesn't like to idly sit around while his cod 阅读全文
摘要：
D. Cakes for Clones You live on a number line. You are initially (at time moment 𝑡=0) located at point 𝑥=0. There are 𝑛 events of the following typ 阅读全文
摘要：
其他写的比较好的文章：https://www.cnblogs.com/snowater/p/8024776.html 我在一次多线程读写map的时候，然后再遍历的时候也遇到了该问题。 现场代码 private ConcurrentHashMap<Long, Set<Long>> m = new Co 阅读全文
摘要：
DCAF: A Dynamic Computation Allocation Framework for Online Serving System 论文地址：https://arxiv.org/pdf/2006.09684.pdf 来源：DLP-KDD 2020 阿里巴巴论文 摘要 现代大规模在线 阅读全文
摘要：
路西德的过去 路西德属于精灵族，诞生于埃欧雷，埃欧雷是精灵王国，埃欧雷在魔法密林的旁边。她与赫丽娜（射手村弓箭手的转职教官）是童年的伙伴，既是朋友，也是竞争对手。 当时埃欧雷的女王是双弩精灵，双弩精灵的名字叫做梅赛德斯。路西德小时候特别希望得到女王双弩精灵的赞赏，为此她和赫丽娜一直在暗中较劲。然而路 阅读全文
摘要：
看错题系列 cf622C C2. Skyscrapers (hard version) 看成了 对于所有的i不能满足a[i 1] a[i]&&a[i] using namespace std; const int maxn = 5e5+7; int n,m[maxn]; long long ans, 阅读全文
摘要：
F. Coffee Varieties time limit per test1 second memory limit per test256 megabytes This is the easy version of the problem. You can find the hard vers 阅读全文
摘要：
E. Prefix Enlightenment time limit per test3 seconds memory limit per test256 megabytes There are n lamps on a line, numbered from 1 to n. Each one ha 阅读全文
摘要：
D. Irreducible Anagrams time limit per test2 seconds memory limit per test256 megabytes Let's call two strings s and t anagrams of each other if it is 阅读全文
摘要：
C. Mind Control time limit per test1 second memory limit per test256 megabytes You and your n−1 friends have found an array of integers a1,a2,…,an. Yo 阅读全文
摘要：
B. Array Sharpening time limit per test1 second memory limit per test256 megabytes You're given an array a1,…,an of n non negative integers. Let's cal 阅读全文
摘要：
A. Even But Not Even time limit per test1 second memory limit per test256 megabytes Let's define a number ebne (even but not even) if and only if its 阅读全文
摘要：
第三章 代码的坏味道 3.1 神秘命名 命名是编程中很难的事情，所以最常用的重构手段就是去改个名字。 如果你发现改名很难，那就说明代码设计有问题。 3.2 重复代码 同一类的两个函数含有相同的表达式，就应该提炼。 3.3 过长函数 活得最长，最好的函数，一般都很短。 如果你觉得需要写注释，大部分情况 阅读全文
摘要：
第二章 重构的原则 2.1 何谓重构 重构分为了动词和名词两种意义。 重构（名词）：对软件内部结构的一种调整，目的是不改变软件可观察行为的前提下，提高其可理解性，降低修改成本。 （问题来了，重构真的降低了可理解性吗） 重构（动词）：使用一系列重构首发，在不改变软件可观察行为的前提下，调整其结构。 重 阅读全文
摘要：
链接: https://pan.baidu.com/s/1b3cTGmABb66zeCV 5DY LQ 提取码: 6a9n 里面存在的个人观点，我都会用斜体来表示。 重要的结论，我会用粗体表示。 序言 开篇讲了一个故事，说一个顾问建议一个团队去重构，重构使得代码变得更美了，但重构花费了时间，并没有新 阅读全文
摘要：
F. Economic Difficulties An electrical grid in Berland palaces consists of 2 grids: main and reserve. Wires in palaces are made of expensive material, 阅读全文
摘要：
E. Editor The development of a text editor is a hard problem. You need to implement an extra module for brackets coloring in text. Your editor consist 阅读全文
摘要：
D. Secret Passwords One unknown hacker wants to get the admin's password of AtForces testing system, to get problems from the next contest. To achieve 阅读全文
摘要：
C. Everyone is a Winner! On the well known testing system MathForces, a draw of n rating units is arranged. The rating will be distributed according t 阅读全文
摘要：
B. PIN Codes A PIN code is a string that consists of exactly 4 digits. Examples of possible PIN codes: 7013, 0000 and 0990. Please note that the PIN c 阅读全文
摘要：
A. Sweet Problem the first pile contains only red candies and there are r candies in it, the second pile contains only green candies and there are g c 阅读全文
摘要：
F2. Wrong Answer on test 233 (Hard Version) Your program fails again. This time it gets "Wrong answer on test 233" . This is the harder version of the 阅读全文
摘要：
E. Arson In Berland Forest The Berland Forest can be represented as an infinite cell plane. Every cell contains a tree. That is, contained before the 阅读全文
摘要：
D2. Optimal Subsequences (Hard Version) This is the harder version of the problem. In this version, 1≤n,m≤2⋅105. You can hack this problem if you lock 阅读全文
摘要：
C. Messy You are fed up with your messy room, so you decided to clean it up. Your room is a bracket sequence s=s1s2…sn of length n. Each character of 阅读全文
摘要：
B. Box Permutation p is a sequence of integers p=[p1,p2,…,pn], consisting of n distinct (unique) positive integers between 1 and n, inclusive. For exa 阅读全文
摘要：
A. Math Problem Your math teacher gave you the following problem: There are n segments on the x axis, [l1;r1],[l2;r2],…,[ln;rn]. The segment [l;r] inc 阅读全文
摘要：
E. The Contest A team of three programmers is going to play a contest. The contest consists of 𝑛 problems, numbered from 1 to 𝑛. Each problem is pri 阅读全文
摘要：
D. Yet Another Monster Killing Problem You play a computer game. In this game, you lead a party of 𝑚 heroes, and you have to clear a dungeon with 𝑛 阅读全文
摘要：
C. Dominated Subarray Let's call an array 𝑡 dominated by value 𝑣 in the next situation. At first, array 𝑡 should have at least 2 elements. Now, let 阅读全文
摘要：
B. Magic Stick Recently Petya walked in the forest and found a magic stick. Since Petya really likes numbers, the first thing he learned was spells fo 阅读全文
摘要：
A. Two Rival Students There are 𝑛 students in the row. And there are two rivalling students among them. The first one is in position 𝑎, the second i 阅读全文
摘要：
D. Catowice City In the Catowice city next weekend the cat contest will be held. However, the jury members and the contestants haven't been selected y 阅读全文
摘要：
我遇到的优秀年轻人的5个特质 （文章整理自一鸣同学在“2016今日头条Bootcamp”上对研发&产品部门应届毕业生的寄语） 大家好！ 各位都非常年轻，我今天来的时候挺有压力。因为我毕业快11年了，看到你们，真是觉得“长江后浪推前浪”。 我去年参加了武汉的校招，感觉新一代年轻人的素质确实都非常好。我 阅读全文
摘要：
我本身是一个非常普通的人。 有幸在两年前通过自己算法竞赛的底子，加入了今日头条 ByteDance 公司。那时候还不叫字节跳动，单纯的只是叫做今日头条而已。那时候的抖音只有几百万dau，我们组也只有三个人而已，旗舰产品还是内涵段子呢。 我记得我刚刚加入公司，公司就组织了一次tb，让我们去大草原上去玩 阅读全文