pi + pj = i + j 可以得到 pi - i = j - pj,即对于每个数a[i],查询前缀里有多少个j满足a[i] - i = j - a[j].
小红有一个长度为n的排列p,他想知道p中有多少个i,j对满足:i<j且pi+pj=i+j。
请你帮他算算吧。
By signing up a CodeFun2000 universal account, you can submit code and join discussions in all online judging services provided by us.