qq_46221910的博客

递推 #include<bits/stdc++.h> using namespace std; int main(){ double a=1,b=3,tmp; while(abs(a/b-0.618034)>=1e-6){ tmp=a; a=b; b+=tmp; } cout<<a<<'/'<<b; return 0; }

暴力搜索超时，这里采用二分 #include<bits/stdc++.h> using namespace std; const int MAXN=100010; int n,k; int h[MAXN],w[MAXN]; bool pd(int l) { int sum=0; for(int i=0; i<n; i++) { sum+=(h[i]/l)*(w[i]/l); if(sum>=k) { ..

这里采用双向链表实现 #include<iostream> using namespace std; struct Node { int val; Node*next; Node*pre; }; void Print(Node*head) { Node*p = head->next; while (p) { cout << p->val << ' '; p = p->next; } } int main() { int n, n..

推荐使用循环链表 #include <iostream> using namespace std; struct Node { int val; Node*next; }; int main() { Node*head = new Node; int n, m, k; cin >> n >> k >> m; head->val = 1; Node*p = head, *tmp = NULL; for (int i = 2; i <=