瓜瓜请多指教

读书笔记

题解(9)

/ 注册

全部文章 / 读书笔记（共8篇）

连续最大乘积

include <bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; vector<double> arr(n); for(int i=0;i<n;i++) ...

2020-07-22

0 0

完全背包问题

include <bits/stdc++.h> using namespace std;const int mod = 1e9+7; int main(){ int n,aim; cin>>n>>aim; vector<int> ar...

2020-07-20

0 0

动态规划

include 《bits/stdc++.h> using namespace std; int main(){ int N,M,K,P; const int mod = 1e9+7; cin>>N>>M>>K>>P; v...

2020-07-20

0 0

一个栈给另一个栈排序

include <bits/stdc++.h> using namespace std; int main(){ stack<int> st1,st2; int n,k; cin>>n; for(int i=0;i<n;i++)...

2020-07-18

0 0

完全背包问题

include <bits/stdc++.h> using namespace std; int main(){ int n,aim; cin>>n>>aim; vector<long long=""> dp(ai...

2020-07-18

0 541

滑动窗口

include <bits/stdc++.h> using namespace std; int main(){ int n,k; cin>>n>>k; vector<int> arr(n); for(int i=0;i<...

2020-07-18

0 0

动态规划

include <bits/stdc++.h> using namespace std; int main(){ int N,ret=0; cin>>N; vector<int> ans(N); vector<int> dp(N...

2020-07-17

0 0

行列排序矩阵查找

class Solution {public: bool Find(int target, vector<vector<int> > array) { if(array.size()==0) return false; if(array[0]...

2020-07-17

0 0