02 2023 档案
摘要：（双指针算法优化）思路： 暴力解法： for(int i = 0; i < n; i ++) for(int j = 0; j <= i; j ++) check(i , j); **算法优化：**找到某种性质，尤其注意解题过程中存在的单调性 for(int i = 0, j = 0; i < n;
阅读全文
摘要：高精度加法 a, b均为正整数 #include <iostream> using namespace std; const int N = 100010; int A[N], B[N], C[N]; int Add(int a[], int b[], int c[], int cnt) { int
阅读全文
摘要：1、自我介绍 Good morning, respected professors! I have been expecting this interview since I got the interview notice. My name is Gaowei. I come from Shanx
阅读全文
摘要：二分思路 #include<iostream> #include<iomanip> using namespace std; double n,l,r,mid; bool flag; double q(double a){return a*a*a;} int main(){ cin>>n; l=-1
阅读全文
