yo_haha的专栏

http://acm.hdu.edu.cn/showproblem.php?pid=1195 这代码好长，不过好多重复的内容。#include <iostream> #include <queue> #include <cstring> using namespace std; struct node { int x, step; }; int vis[10000]; node q1[10

http://acm.hdu.edu.cn/showproblem.php?pid=1686 简单kmp#include <cstdio> #include <cstring> using namespace std; int Next[10005]; char c[1000005]; char t[10005]; int main() { int num; scanf("%d",

http://acm.hdu.edu.cn/showproblem.php?pid=1358 求某个前缀含几个循环 用kmp的next数组#include <cstdio> #include <cstring> using namespace std; int Next[1000005]; char c[1000005]; int main() { int len; int cnt

http://acm.hdu.edu.cn/showproblem.php?pid=1671 简单的字典树 注意每次要释放内存 不然会MLE#include <iostream> #include <cstring> #include <string> #include <algorithm> using namespace std; struct node { int sign;

http://acm.hdu.edu.cn/showproblem.php?pid=1251 MLE了无数次…最后换了种方法#include <iostream> #include <cstring> #include <cstdio> using namespace std; struct node { int num; int next[26]; void ini()

http://acm.hdu.edu.cn/showproblem.php?pid=2899在[0,100]上F’x单调增 所以求F’(x0)=0 将x0代入F(x) 即为答案#include <cstdio> #include <cmath> #include <iostream> using namespace std; const double res=1e-6; double ans(d

http://acm.hdu.edu.cn/showproblem.php?pid=1394#include <cstdio> using namespace std; const int maxx=5100; int sum[maxx<<2]; #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 void pushup(int rt) { s

http://acm.hdu.edu.cn/showproblem.php?pid=1754#include <cstdio> using namespace std; const int maxx=200000; int sum[maxx<<2]; #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 int MAX(int a, int b) {

http://acm.hdu.edu.cn/showproblem.php?pid=1166 线段树模板题#include <cstdio> using namespace std; #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 const int maxx=55555; int sum[maxx<<2]; void PushUp(int rt

http://acm.hdu.edu.cn/showproblem.php?pid=1160#include <iostream> #include <algorithm> #include <cstdio> using namespace std; struct mice { int w,s,num,p; }; bool cmp(mice a, mice b) { if(a.w==

http://acm.hdu.edu.cn/showproblem.php?pid=1003#include <iostream> using namespace std; int a[100001]; int main() { int t,n,b,e,rb,maxx,sum,k; cin>>t; k=1; while(t--) { cin>>

http://acm.hdu.edu.cn/showproblem.php?pid=1016#include <cstdio> #include <cstring> using namespace std; int prime[40]={0}; int n,count; int ans[21]; int vis[21]; void dfs(int x) { if(count==n&&!pri

http://acm.hdu.edu.cn/showproblem.php?pid=1150#include <iostream> #include <cstring> using namespace std; const int maxx=102; int gra[maxx][maxx]; int cx[maxx];int cy[maxx]; int sy[maxx]; int m,n,ans,k

http://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=2§ionid=1&problemid=11 对一个数num可写为 num=10^n * a, 即科学计数法，使a的整数部分即为num的最高位数字num^num=10^n + a 这里的n与上面的n不等两边取对数： num*lg(num) = n + lg(a);因为

http://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=3§ionid=2&problemid=2 dp[i][j]=max(dp[i-1][j],dp[i][j-1]) s1[i]!=s2[j] dp[i][j]=dp[i-1][j-1]+1 s1[i]==s2[j]#include<stdio.h> #includ

http://acm.hdu.edu.cn/game/entry/problem/show.php?chapterid=3§ionid=2&problemid=8 自底向上 状态转移方程为:dp[i][j]=max(dp[i+1][j-1],dp[i+1][j],dp[i+1][j-1])+pie[i][j]#include<stdio.h> #include<string.h.>

http://acm.hdu.edu.cn/showproblem.php?pid=2063#include <iostream> #include <cstring> using namespace std; const int maxx=502; int gra[maxx][maxx]; int sx[maxx];int sy[maxx]; //记录是否被访问过 int cx[maxx];int

http://acm.hdu.edu.cn/showproblem.php?pid=1045#include <iostream> #include <cstring> using namespace std; const int maxx=102; int cx[maxx];int cy[maxx]; int sx[maxx];int sy[maxx]; char gra[maxx][maxx];

#include <iostream> #include <string> #include <mem.h> using namespace std;int main() { string s1,s2; cin>>s1>>s2; int a[1000]; int b[1000]; memset(a,0,sizeof(a)); memset(b,0,si

A + B Problem IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 251504 Accepted Submission(s): 48449Problem Description I have a very simpl