Ellery的book

https://blog.youkuaiyun.com/ryo_218/article/details/84866037

学了一周，快哭了； 参考博客：https://blog.youkuaiyun.com/zuzhiang/article/details/78136480; 我的代码： #include<iostream> #include<stack> #include<algorithm> #include<math.h> using namespace std; typed...

#include<iostream> #include<set> #include<algorithm> #include<string.h> #include<string> using namespace std; typedef long long LL; int main(){ string s1,s2; set <s...

Description 小花梨给出

FJ’s N (1 ≤ N ≤ 10,000) cows conveniently indexed 1…N are standing in a line. Each cow has a positive integer height (which is a bit of secret). You are told only the height H (1 ≤ H ≤ 1,000,000) of t...

| so easy There are nnn points in an array with index from 111 to nnn, and there are two operations to those points. 1: 1 x1 \ x1 x marking the point xxx is not available 2: 2 x2 \ x2 x query for the ...