yo_bc的博客

Ali has taken the Computer Organization and Architecture course this term. He learned that there may be dependence between instructions, like WAR (write after read), WAW, RAW. If the distance between two instructions is less than the Safe Distance, it wil

You have been given a matrix C N*M, each element E of C N*M is positive and no more than 1000, The problem is that if there exist N numbers a1, a2, … an and M numbers b1, b2, …, bm, which satisfies that each elements in row-i multiplied with ai and each el

In Fuzhou, there is a crazy super man. He can’t fly, but he could jump from housetop to housetop. Today he plans to use N houses to hone his house hopping skills. He will start at the shortest house and make N-1 jumps, with each jump taking him to a taller

差分约束系统其实就是将不等式组的求解问题转化为最短路进行求解，所以属于图论。但往往抽象出不等式组是不容易的。差分约束系统入门可看这位大佬的博文：夜深人静写算法（四）本题大意：n个区间，输入n行ai，bi，ci，代表在区间[ai, bi]上至少要选择ci个整数点，可以在区间内任意取ci个不重复的点。求包括所有区间的区间内至少要取多少个整数点。思路：用d[i]表示从0到i至少要