Lunar Arc的博客

区间DP 模板 282. 石子合并#include<iostream>#include<cmath>#include<algorithm>#include<cstdio>#include<cmath>#include<cstring> #define rg registerusing namespace std;typedef long long ll;int sread(){ int x=0,f=1;cha

动态规划dp、背包 刷题小记开心的金明采药砝码称重导弹拦截纪念品开心的金明//开心的金明 https://www.luogu.com.cn/problem/P1060#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<cstring>#define rg registerusing namespace std;typedef l

完全背包 模板// 完全背包 #include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<cstring>#define rg registerusing namespace std;typedef long long ll;inline int sread(){ int x=0,f=1;char c=getchar();

01背包 模板//01背包 #include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<cstring>#define rg registerusing namespace std;typedef long long ll;inline int sread(){ int x=0,f=1;char c=getchar();

Acwing 272. 最长公共上升子序列朴素版#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<cstring>#define rg registerusing namespace std;typedef long long ll;inline int sread(){ int x=0,f=1;char c=get

算法分析本题实质上是寻找一个最长队列，该队列有以下性质：1.1~i：单调上升队列2.i+1~n：单调下降队列代码实现#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<cstring>#define rg registerusing namespace std;typedef long long ll;inline in.

#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<cstring>#define rg registerusing namespace std;typedef long long ll;inline int sread(){ int x=0,f=1;char c=getchar(); while(c>'9.