- 博客(7)
- 收藏
- 关注
RSS订阅原创 dp
动态规划字符串问题1. 最大子序列和总结1. 最大子序列和#include <cstdio>#include <algorithm>#include <iostream>using namespace std;const int maxn = 1000000;long long dp[maxn];long long a[maxn];int main(){ int n; long long res=-1000000; wh..
2021-03-07 11:22:14
65
原创 PAT1019
PAT1019#include <cstdio>#include <algorithm>#include <iostream>#include <string>using namespace std;int main(){ int val; int base; cin >> val >> base; int index = 1; int arr[100]; while (val != 0) { arr[i
2021-01-22 21:38:11
58
原创 字符串简单模拟
PATB1009#include <stack>#include <cstdio>#include <string>#include <iostream>using namespace std;int main(){ string s; stack<string> v; while(cin >> s) v.push(s); cout << v.top();
2021-01-17 16:28:06
124
原创 PAT1045
PAT1045(LIS法)#include <cstring>#include <iostream>#include <cstdio>#include <algorithm>using namespace std;int color_num[201];int stripe[10001];int dp[10001];int main(){ int N; cin >> N; int n; cin &g
2021-01-15 23:10:28
78
1
原创 PAT1002
PAT1002#include <cstdio>#include <algorithm>#include <iostream>using namespace std;int main(){ float a[1001]={0}; int index; float num; int n; cin >> n; for(int i=0;i<n;i++) { scanf("%d%f
2021-01-14 15:31:09
77
原创 PAT1001
提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档PAT1001#include <iostream>#include <string>#include <sstream>using namespace std;int main(){ int a,b; cin >> a >> b; string s; stringstream ss; ss << (a+b);
2021-01-14 15:26:43
70
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人