- 博客(108)
- 资源 (1)
- 收藏
- 关注
RSS订阅转载 TPC-H数据导入MySQL教程
原文地址：http://www.cnblogs.com/joyeecheung/p/3599698.html 参考链接：http://www.tuicool.com/articles/fAZjqa 原作者的教程已经写的很详细了，但是其中涉及到github的链接都打不开，在网上找了其他版本，整合了一下TPC-H数据导入MySQL教程0. TPC-H是啥TPC-H是TPC提供的一个benchmark
2016-07-26 15:58:51
1517
原创 js 查询IP归属地
用的是新浪的IP地址查询接口“`javascript $.getScript(‘http://int.dpool.sina.com.cn/iplookup/iplookup.php?format=js&ip=‘+ip, function(_result){ console.log( remote_ip_info); });
2016-05-20 17:56:35
2801
原创 nginx Thinkphp rewrite
location / { #原有代码 if (!-e $request_filename) { rewrite ^/index.php(.*)$ /index.php?s=$1 last; rewrite ^(.*)$ /index.php?s=$1 last; brea
2015-12-22 15:31:30
893
原创 ssh can't be established.
问题：ssh username@XX.XX.XX.XX 出现The authenticity of host 'XX.XX.XX.XX' can't be established.RSA key fingerprint is ...Are you sure you want to continue connecting (yes/no)? exit解决方法：
2015-05-09 11:28:37
2629
原创 Zendstudio 改变配色
菜单栏 help–install new softwareWork with ：http://eclipse-color-theme.github.com/update/选择eclipse_color_theme安装并重启菜单栏 window -preference 搜索theme 选择主题并应用
2015-03-17 11:42:00
885
原创 HDU 1816
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1816#include #include#include#include#include#include#define maxn 4050#includeusing namespace std;struct edge{ int x,y;}key[maxn]
2014-08-15 16:00:02
851
原创 HDU 3564 线段树+LIS
#include #include#include#include#include#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define N 100005using namespace std;int sum[N<<2],a[N],cnt=0,tmp[N];void pushup(int rt){ sum[rt]=s
2014-08-04 16:39:40
772
原创 HDU 1677 LIS
#include #include#include#include#define N 200005#includeusing namespace std;int dp[N];struct node{ int w,h;}a[N];bool cmp(node x,node y){ if(x.w==y.w) return x.h<y.h; return
2014-08-04 01:18:12
836
原创 HDU 4604 lower_bound,LIS
题目链接：#include #include#include#include#include#define INF 0x7fffffff#define N 100005#include#includeusing namespace std;int n,same[N];void solve(int dp[],int a[]){ vectorv; fo
2014-08-04 00:45:12
776
原创 HDU 4862 最小费用最大流，判满流
#include #include#include#include#include#define INF 0x7fffffff#define MAXN 505#include#define MAXE 10005using namespace std;int net[MAXN],size;struct EDGE{ int v,next,cap,cost;}e[MAXE
2014-07-23 19:37:55
810
原创 UVA 11426 欧拉函数
#include #include#include#include#include#define LL long long#define maxn 4000000using namespace std;LL s[maxn+1],f[maxn+1],phi[maxn+1];void phi_table(LL n){ for(LL i=2;i<=n;i++)phi[i]=0;
2014-07-17 16:45:08
626
原创 UVA 1069
#include #include#include#include#include#define LL long longusing namespace std;LL d,c[105];char s[10005];LL pow_mod(LL x,LL y){ LL ret=1; while(y){ if(y&1) ret=ret*x
2014-07-17 15:30:56
729
原创 DZY Loves Fibonacci Numbers
题目链接：http://codeforces.com/problemset/problem/446/C题意：
2014-07-15 15:07:58
907
原创 HDU 3374
参考KMP+最大最小表示法#include #include#include#include#include#define N 1000005using namespace std;char str[N];int fail[N];void kmp(int m){ fail[0]=-1; for(int i=1,j=-1;i<m;i++){
2014-07-07 21:16:32
646
原创 HDU2222 AC自动机入门
//用指针写的#include #include#include#include#include#includeusing namespace std;char str[1000005];struct Tire{ Tire *child[26]; Tire *fail; int cnt; Tire(){ cnt=0;
2014-07-06 19:14:26
641
原创 HDU 1358
#include #include#include#include#include#define N 1000005using namespace std;char str[N];int fail[N];void KMP(int m){ fail[0]=-1; for(int i=1,j=-1;i<m;i++){ while(j>=0&&str[j
2014-07-01 00:30:56
672
原创 HDU 3336
#include #include#include#define N 200005#define mod 10007using namespace std;char str[N];int fail[N];int dp[N];void kmp(int n){ fail[0]=-1; for(int i=1,j=-1;i<n;i++){ if(j>=0
2014-07-01 00:15:18
587
原创 KMP模板
KMP模板void KMP(int B[],int m) { fail[0] = -1; for (int i = 1 , j = -1; i < m ; i ++) { while (j >= 0 && B[j+1] != B[i]) j = fail[j]; if (B[j+1] == B[i]) j ++; fail[i] = j; }}bool match(i
2014-06-30 19:21:32
486
原创 HDU 1505
HDU 1506 加强版#include #include#include#include#include#define N 1005using namespace std;int map[N][N],h[N][N],dpl[N],dpr[N];char tmp[3];int main(){ int ans,k,i,j,n,m,temp,t; sc
2014-05-21 21:12:37
638
原创 HDU 4824 (2014百度之星资格赛1002)
跟HDU2224 类似http://blog.youkuaiyun.com/a634771197/article/details/26486159
2014-05-21 16:48:52
1430
原创 HDU 2795 线段树
参考http://www.notonlysuccess.com/index.php/segment-tree-complete/
2014-05-09 18:19:56
610
原创 HDU 2426 KM
#include #include#include#include#include#include#define INF 60001#define N 1005using namespace std;int nx,ny,lx[N],ly[N],link[N],slack[N],visx[N],visy[N],w[N][N];bool DFS(int x){ int y;
2014-05-07 16:52:10
701
原创 HDU 3435 A new Graph Game
#include #include#include#include#include#include#define INF 60001#define N 1005using namespace std;int nx,ny,lx[N],ly[N],link[N],slack[N],visx[N],visy[N],w[N][N];bool DFS(int x){ int y;
2014-05-07 16:27:53
664
原创 HDU 3488 Tour 最小费用最大流||最大匹配
#include #include#include#include#include#include#define INF 0x7fffffff#define MAXN 405#define MAXE 60805using namespace std;int net[MAXN],size;struct Edge{ int v,next,cap,cost;}edge[M
2014-05-07 13:47:37
773
原创 HDU 3605 Escape 最大流，状压
#include #include#include#include#include#define MAXN 1100#define MAXE 21000#define INF 0x7fffffffusing namespace std;int num[MAXN];struct Edge{ int to,from,cap,next;}edge[MAXE];int he
2014-05-06 22:48:08
678
ZendStudio12.0.2破解
2016-04-22
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人