该文被密码保护。 阅读全文
摘要：
题面:https://www.luogu.org/problemnew/show/P3047 cpp Code: include using namespace std; const int root=1,MAXN=100001; struct rec{ int pre,to; }a[2 MAXN] 阅读全文
摘要：
题面:https://www.luogu.org/problemnew/show/P3258 cpp 本题中每次所修改路径的终点等于下一次所修改路径的起点,所以每次修改完后要将终点的果子数 1。 Code: include include include include include includ 阅读全文
摘要：
题面:https://www.luogu.org/problemnew/show/P3901 cpp Code: include include include include include include include using namespace std; const int N=1000 阅读全文
摘要：
题面:https://www.luogu.org/problemnew/show/P2709 cpp 本题的关键在于sum(n)² sum(n 1)²=sum(n)² sum(n)²+2 sum(n) 1=2 sum(n) 1 Code: include include include includ 阅读全文