PPXppx

摘要： "洛咕" "双倍经验" 题意:给定一个包含$m(m include include include include include include include define ll long long using namespace std; inline int read(){ int x=0, 阅读全文

摘要： "洛咕" 题意:$n(n=mid$,相当于我们现在要给$ "l,r]$中每个数都加上1,相当于是区间增加操作,然后统计答案的时候就是区间询问了,可以用线段树(好像还不是普通的线段树)维护,本人太懒,为此学了一下树状数组的区间修改和区间询问操作,推荐一篇[博客:树状数组的区间修改和区间询问操作" . 阅读全文

摘要： "洛咕" 题意:给定n个数的序列,维护两种操作,一是修改$a[x]=y$,二是查询$[l,r]$中第$k$小的数是多少.$n,m include include include include include include include define ll long long using nam 阅读全文

摘要： "POJ" 题意:$n(n=2)$头牛前面有$a_i$头牛比它矮,求每头牛的身高. 分析:倒序来考虑.第$n$头牛前面有$a_n$头牛比它矮,则$h_n=a_n+1$.第$n 1$头牛前面有$a_{n 1}$头牛比它矮,如果$a_{n 1} include include include inclu 阅读全文

摘要： "POJ" "洛咕" 题意:给定$n(n include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;c 阅读全文

摘要： "洛咕" 题意:给定一个大小为$n(n include include include include include include include define ll long long using namespace std; inline ll read(){ ll x=0,o=1;char 阅读全文

摘要： "洛咕" 题意:给定$n(n include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;char ch 阅读全文

摘要： "洛咕" 题意:现在有$n(n include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;char c 阅读全文

摘要： "洛咕" 题意:$Farmer John$有$N$只奶牛,($4 include include include include include include include define ll long long using namespace std; inline int read(){ i 阅读全文

该文被密码保护。 阅读全文