摘要:
[一]二分查找 解题思路 套模板即可 代码实现 #include<bits/stdc++.h> using namespace std; const int maxn=1e5+7; int n,q,a[maxn]; int main(){ cin>>n; for(int i=1;i<=n;i++) 阅读全文
摘要:
01 [AtCoder-abc336_a] Long Loong Problem Statement For a positive integer X, the Dragon String of level X is a string of length (X+3) formed by one L, 阅读全文