书名:Harry Potter and the Goblet of Fire 作者:J.K. Rowling 篇幅: 752页 蓝思值:880L 用时: 17天 工具: 有道词典 [透析成果] 这是我读完的第5本英文原著,用词典查了198个单词. 速度有明显提升.大幅降低.如今基本4.5页查一个生词. 以下是全部单词: 1, intrigue ['ɪn'triɡ] n. 阴谋:诡计.复杂的事:私通 vt. 用诡计取得:激起...的兴趣 vi. 私通.密谋 2, riddle [
Description The N (2 <= N <= 10,000) cows are so excited: it's prom night! They are dressed in their finest gowns, complete with corsages and new shoes. They know that tonight they will each try to perform the Round Dance. Only cows can perform the
这… 本来想学习一下Tarjan算法的,没想到码都码好了发现这题不是求强连通分量而是简单的连通分量…图论基础都还给老师了啊啊啊!最后深搜通通解决! v标记是否被访问过,scc标记每个的祖先(本来想写Tarjan的才弄出这么奇葩个数组名字),w用于最后的统计. program vijos_p1023; ..,..] of longint; v,w:..] of boolean; n,m,t,i,ans,top:longint; low,s,scc:..] of longint; procedure
f[i,0] 表示 第i个人不参加舞会 f[i,1] 表示 第i个人参加舞会 f[i,1]=sigma(f[j,0])+v[i] j 为 i 的孩子 f[i,1]=sigma(max(f[j,0],f[j,1])) j 为 i 的孩子 ans=max(f[root,0],f[root,1]) Program CODEVS1380; type arr=record u,v,next:longint; end; ; ..maxn] of arr; last:..maxn] of longin
Description The N (2 <= N <= 10,000) cows are so excited: it's prom night! They are dressed in their finest gowns, complete with corsages and new shoes. They know that tonight they will each try to perform the Round Dance. Only cows can perform the