- 博客(5)
- 收藏
- 关注
RSS订阅原创 dijkstra
#include#include#include#include#includeusing namespace std; #define M 2139062143#define MM 1001int m,n,s;int w[MM][MM],f[MM],next[MM][1001];int main(){scanf("%d%d%d",&n,&m,&s)
2016-12-31 14:43:20
147
原创 线段树
#include#include#include#include#includeusing namespace std;#define maxn 200001int st[maxnvoid build(int o,int l,int r){ if(l==r) st[o]=a[l];else{int m=l+((r-l)>>1);build(o
2016-12-23 16:25:22
146
原创 逻辑运算
#include#include#include#include #includeusing namespace std;int v,n,m,a[100],f[20001];int main(){scanf("%d%d",&v,&n);for(int i=1;iscanf("%d",&a[i]);f[0]=1; for(int i=1;ifo
2016-12-21 15:54:43
194
原创 背包数量
#include#include#include#include #includeusing namespace std;int n,m,a[10001],i,j,k;long long f[10001];int main(){scanf("%d%d",&n,&m);for(i=1;iscanf("%d",&a[i]);f[0]=1;for(
2016-12-21 15:14:09
226
原创 合并石子，区间DP
#include#include#include#include#includeusing namespace std;int i,j,k,n,f[1000][1000],s[1000],a[10000],ff[1000][1000];int main(){ scanf("%d",&n);for(i=1;i{scanf("%d",&a[i]);a
2016-12-21 14:28:40
240
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人