- 博客(16)
- 收藏
- 关注
原创 [递推] 洛谷P1010
题目代码#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<cctype>#include<ctime>#include<iostream>#include<string>#includ...
2020-03-30 21:47:59 158
原创 [dp] 洛谷P1164
题目思路dp[i][j] 为到第i个前面花的钱为j如果j==a[i] 可以选择前面花,第i个不花和前面不花,第i个花 由此dp[i][j]=dp[i-1][j]+1其他两种情况同理代码#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include...
2020-03-29 00:47:43 155
原创 后缀表达式求值
题目代码#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<cctype>#include<ctime>#include<iostream>#include<string>#includ...
2020-03-27 15:51:10 149
原创 中缀表达式转后缀表达式
题目代码#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<cctype>#include<ctime>#include<iostream>#include<string>#includ...
2020-03-27 15:19:35 161
原创 [dfs||01背包] 洛谷P2392
题目思路1题上可以分两组,dfs跑所有情况,取最小的最大值。代码#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<cctype>#include<ctime>#include<iostream>...
2020-03-25 22:35:49 205
原创 [递归] 洛谷P1928
题目递归太巧妙啦 可惜我这个脑子想不出来代码#include<bits/stdc++.h>using namespace std;string read(){ string s,s1; char c; while(cin>>c){ if(c=='['){ int n; cin>>n; s1=rea...
2020-03-25 18:11:27 226
原创 [卡特兰数||记忆化搜索||dp]P1044 栈
题目题目链接:https://www.luogu.com.cn/problem/P1044思路1这个是一个卡特兰数的板子题递推式1:递推式2:卡特兰数,其前几项为 : 1, 2, 5, 14, 42, 132, 429…代码:#include<cstdio>#include<cstring>#include<cmath>#includ...
2020-03-24 23:59:15 115
原创 [kmp] 洛谷P3354
题目题目链接:https://www.luogu.com.cn/problem/P3375代码#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<cctype>#include<ctime>#include<...
2020-03-22 16:16:13 2127
原创 [manacher] CF1326D2
题目题目链接:https://codeforces.com/contest/1326/problem/D2思路有两种情况,第一种情况是前后字串有一个是空,跑这个时候的manacher,询下这个时候的最长回文串。第二种情况是前后没有空串,把前后的回文串记录下,对剩下中间的跑一次manacher代码#include<cstdio>#include<cstring&g...
2020-03-21 23:31:33 332
原创 [记忆化搜索] 洛谷P1141
题目题目链接:https://www.luogu.com.cn/problem/P1141思路01迷宫里,在一片区域内的点能够到的最多的路径是相同的。用f来记录这一片点最多的步数ans记录答案代码#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#...
2020-03-14 18:13:04 191
原创 [dp] cf 1324E
题目题目链接:https://codeforces.com/contest/1324/problem/E思路dp[i][j]存第i个数前面减了j个小时,瞎dp吧,我想睡了代码#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<cc...
2020-03-14 01:15:15 200
原创 [pta]帮乐礼相写的的大整数加法
题目这道题其实没啥好说的但是我做了很久真的我太菜了我居然不知道十进制之后的树会有ABCD表示wa了好久找不到错,我真傻,真的代码#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<cctype>#include&...
2020-03-14 00:29:34 336
原创 [树] cf1324F
题目题目链接:http://m1.codeforces.com/contest/1324/problem/E思路dp[i][j]表示第i个数字前面提前j个小时对应的good pair个数代码#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#inclu...
2020-03-14 00:05:34 74
原创 [没啥] cf1323 B
题目又是忘打cf的一天…题目链接:https://codeforces.com/contest/1323/problem/Bwa了一发,记得long long代码#include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<cctype&g...
2020-03-08 16:13:45 192
原创 [思维] cf 1305
题目题目链接:https://codeforces.com/contest/1305/problem/C思路分两种情况,当n>m时,i在(1,n)中,只要有两个个a[i]%m相等一定就可以。因为此时n>m,n大于模数,一定会有相等的情况。当n<=m时,因为m<=1000暴力出奇迹代码#include<cstdio>#include<cstr...
2020-03-07 10:19:37 79
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人