
线性动态规划(洛谷)
线性dp
yyd_s
这个作者很懒,什么都没留下…
展开
-
P1091 [NOIP2004 提高组] 合唱队形
#include<cstdio>#include<iostream>#include<algorithm>#include<vector>#define MAXN 105typedef long long ll;using namespace std;int n;int h[MAXN];bool cmp(int a,int b){ return a>b;}int find(int b,int e){ vector<int.原创 2022-05-01 10:43:16 · 133 阅读 · 0 评论 -
P1233 木棍加工
//#define local#include<cstdio>#include<iostream>#include<vector>#include<algorithm>#define MAXN 5005using namespace std;typedef long long ll;struct size{ int l,w; size(int l=0,int w=0):l(l),w(w){ } bool operator <.原创 2022-05-01 10:41:54 · 150 阅读 · 0 评论 -
P1077 [NOIP2012 普及组] 摆花
//#define local#include<cstdio>#include<iostream>using namespace std;typedef long long ll;int n,m;int a[105],sum[105]={0}; ll f[105][105]={0};const ll mod=1e6+7; int main(){#ifdef localfreopen("data.in","rb",stdin);//freopen("data..原创 2022-05-01 10:40:41 · 202 阅读 · 0 评论 -
P4933 大师
//#define local#include<cstdio>#include<iostream>#include<vector>#define MAXN 1005#define MAXD 20000#define MOD 998244353using namespace std;typedef long long ll;ll dp[MAXN][2*MAXD+1]={0};vector<int>h;int n; int main(){.原创 2022-05-01 10:39:48 · 211 阅读 · 0 评论 -
P1280 尼克的任务
//#define local#include<cstdio>#include<iostream>#include<cmath>#include<vector>#define MAXN 10005using namespace std;typedef long long ll; int n,k;vector<int>t[MAXN];int f[MAXN]={0};int main(){#ifdef localfreope.原创 2022-05-01 10:38:53 · 269 阅读 · 0 评论 -
P1020 导弹拦截
//#define local#include<cstdio>#include<iostream>#include<algorithm>#include<vector>#define MAXN 2002using namespace std;typedef long long ll; bool compare(int &a,int &b,int &cheak){ if(cheak==0) return a>b.原创 2022-05-01 10:37:19 · 305 阅读 · 0 评论