• ## Orange Boy Can You Solve It Out? Ep.14.5

思考题 that is easier than #14 Sort and Sort and Sort and Sort You are given an integer array A of length N. And you are given Q queries. For each query, you are given Li and Ri. You need to find out the sum of products of adjcent numbers in the so……
XGN 2019年7月10日
• ## Orange Boy Can You Solve It Out? Ep.14

思考题 specially Orange Boy And Orange Program Orange Boy is a programmer of Sunway TaihuLight. One day he wrote the following program to test the super computer: int n; int a[100005]; int getAns(int l,int r,int x){ int ans=0; for(int i=l;i
XGN 2019年7月8日
• ## Orange Boy Can You Solve It Out? Ep.13

思考题 on trees again Tree You are given a weighted undirected tree T of N nodes. Each edge i has a weight W_i. Assume that the edges you need to travel from node i to j is E_1,E_2,E_3...E_k then we define \$c_{i,j}=(-1)^k \times \sum {i=0}^kW{E_i}F……
XGN 2019年6月29日
• ## Orange Boy Can You Solve It Out? Ep.12

思考题for Ep.11 Lunatic Walking Orange Boy loves walking. One day, he wanna walk from (sx,sy) to (ex,ey) the boy can walk in three types: from (x,y) to (x\pm1,y) by costing A yuan from (x,y) to (x,y\pm1) by costing B yuan from (x,y) to (x+1,y+1……
XGN 2019年6月23日
• ## Orange Boy Can You Solve It Out? Ep.11

是时候放松一下，做一道简单的题目了 Walking Orange Boy loves walking. One day, he wanna walk from (x_1,y_1) to (x_n,y_n) the boy can walk in three types: from (x,y) to (x\pm1,y) by costing A yuan from (x,y) to (x,y\pm1) by costing B yuan from (x……
XGN 2019年6月23日
• ## Orange Boy Can You Solve It Out? Ep.10

思考题 from school PKU PK P Given an integer array A of length N. Define a number is strong if it is not the first or the last number in an array and it is strictly bigger than both the number before and after it. For example, in the array [2,0,1,7……
XGN 2019年6月23日
• ## Orange Boy Can You Solve It Out? Ep.9

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<……
XGN 2019年6月18日
• ## Orange Boy Can You Solve It Out? Ep.8

思考题 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……
XGN 2019年6月10日
• ## Orange Boy Can You Solve It Out? Ep.7

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……
XGN 2019年6月1日
• ## Orange Boy Can You Solve It Out? Ep.6

思考题 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……
XGN 2019年5月3日