- 博客(8)
- 问答 (1)
- 收藏
- 关注
RSS订阅原创 POJ3237 树链剖分+线段树
# include # include # include # include # include # include # include # include # include # define inf 0x3f3f3f3f # define N 100000 using namespace std; struct edge { int fro
2014-09-29 20:05:30
601
原创 HDOJ 5001 walk 概率dp
AC代码如下：以dp[wa# include # include # include # include # include # include # include # include # include # include # define inf 0x3f3f3f3f using namespace std; typedef long long ll; double dp[2][55][
2014-09-13 22:09:13
539
原创 模板——大数相乘
两个大数相乘 # include # include # include using namespace std; char a[300],b[300]; int main() { while(scanf("%s%s",a,b)!=EOF) { if(a[0]=='0'||b[0]=='0') { printf("0\n"); continue;
2014-03-22 11:10:48
693
原创 UVA 674 - Coin Change
又是背包问题，由于刚入门，想了很久 # include # include long d[7500]; int main() { int coin[5]={50,25,10,5,1}; memset(d,0,sizeof(d)); d[0]=1; for(int i=0;i<5;i++) { for(int j=1;j<7500;j++) { if(j-coin[i]>
2014-03-20 21:34:01
675
原创 10405 - Longest Common Subsequence
动态规划的入门题，求最长公共子序列 # include # include int max(int a,int b); int d[1005][1005]; char str1[1005],str2[1005]; int main() { while(gets(str1)&&gets(str2)) { memset(d,0,sizeof(d)); int len1
2014-03-20 15:35:46
591
原创 307 - Sticks
# include # include # include using namespace std; int judge(int length); int dfs(int cur,int sum,int length,int deep); int queue(int deep,int length); int n,stick[105],vis[105],be_used[105]; int ma
2014-03-14 19:51:52
658
原创 10400 - Game Show Math
用状态数组来剪枝的一种方法# include# include # include int dfs(long ans,int cur); int range(long a); long number[105],que; int n,vis[64010][110]; char record[105]; int main() { int test; scanf("%d",&test); re
2014-03-14 19:47:54
1071
空空如也
C++模板函数重载的一个问题？
2015-08-05
TA创建的收藏夹 TA关注的收藏夹
TA关注的人