Solved! Difficulty: Div2B-Div2C 思考题 that seems easy A perfect word Given N strings. Find out a longest string so that each substring of it is one of the N strings. Example Input str={a,t,at,orange} Output at Constriants Subtask 1(30%):N<……

思考题 for stupid myself A well-known task Given N segments [L_i,R_i] with weight W_i. Now you want to choose some segments s_1,s_2,s_3,...,s_k so that |[L_{s_1},R_{s_1}]\cap [L_{s_2},R_{s_2}]\cap ...\cap [L_{s_k},R_{s_k}]|*\sum_{i=1}^kW_{s_i} is m……

unsolvable 思考题 for unsolvable monkey Dragon Bone Reborn As a dragon yourself, it is very hard for you to live for every day there're a lot of knights who want to kill you and your bones are frequently broken. Your bone system can be seen as a un……

思考题 for no one Tour You are given a tree of N nodes. Given another integer array A of length M. Little CMJ chooses M sequences of nodes. The i-th of them is X_1,X_2...X_{A_i} and he chooses them so that for each 1\leq i\leq A_i-1,there's an edge……

思考题 for blue boy Roguelike Tree Statement You are given a tree of N nodes. Each node could be 3 status: passable(.), impassable(X), unknown(?). Now we randomly replace each "unknown" to "passable" or "impassable" then we need to find out the exp……

思考题 for nobody Rougelike Game You are given a graph of N*M grids. Each grid can be a wall 'X',a path'.' or unknown '?' One grid is the start point 'S' and one grid is the end point 'E' Now we change the '?' randomly to 'X' or '.' and run shortes……

Rong Kong is a filial boy. There are N pears on the table. Both he and his brother can eat them. They both want to eat as much as they can. Each of them weighs a[i]. It costs a[i] time for a boy to eat a pear weighing a[i] and it gives him a[i] sat……

考虑空气阻力的竖直上抛问题 由于这篇blog语言儒雅随和通俗易懂，所以一般通过观众也可以放心观看 阻力 f=mkv^2, 其中m为物体质量，k为常数 阻力始终与运动方向相反 重力加速度为g 以初速度 v_0 将该物体上抛，试描述其运动速度与时间的关系 Answer: 首先因为阻力的方……

由于这篇blog语言儒雅随和通俗易懂，所以一般通过观众也可以放心观看 例题（著名题）： $\int^{\infty}{0}{\frac{{e^{cosx}}{sin(sinx)}}{x}}dx这道题乍一看很复杂，当时我也想了十万甚至九万分钟，但其实在回顾过3B1B的傅里叶变换后，才发现这是一道可以用傅里叶级……

思考题 for everyone Man on Graph Given a graph of N nodes and M edges. On node i there are A_i men. Then each person moves along 1 edge randomly connected to the node he stands. But if two men walked along the same edge, they'll fight and both die.……