chriselp

以指派问题为例写的一个用循环实现dfs的方法.(gcc) #include #include #include int main(void) { int n, m; while(~scanf("%d%d",&n, &m)) { int Eft[n][m], i, j; for(i = 0; i < n; ++i) { for(j = 0; j < m; ++j) {

#include #include using namespace std; int mode(vector& a, int left, int right, int& num) { int L = left, R = right; int T = a[L]; while (L < R) { while (a[R] >= T && L < R) --R; a[L] = a[R]

#pragma once #include #include #include using namespace std; const unordered_set keywords({ "auto", "short", "int", "long", "float", "double", "char", "struct", "union", "enum", "typedef", "const

/* * RBT.h * * Created on: Nov 30, 2015 * Author: chris */ #pragma once #include enum NodeColor{RED, BLACK}; typedef int KeyType; struct RBTNode{ RBTNode *right, *left, *p; NodeColor colo

/* * HashTable.h * * Created on: Nov 19, 2015 * Author: chris */ #pragma once #include const int numofsizes = 7; const int hashsize[] = { 11, 19, 31, 41, 53, 61, 71 }; typedef int KeyType;

/* * BST.h * * Created on: Oct 31, 2015 * Author: chris */ #ifndef BST_H_ #define BST_H_ #include typedef int KeyType; struct ElemType{ int val; ElemType(): val(0) {} }; typedef struc

/* * BMT.h * * Created on: Nov 2, 2015 * Author: chris */ #ifndef BMT_H_ #define BMT_H_ #include #define m 3 struct Record{ //empty. }; typedef int KeyType; typedef struct BMTNode{

/* * Main.cpp * * Created on: Oct 7, 2015 * Author: chris */ #include #include using namespace std; bool get_next(const char* pat, int*& next) { int len = strlen(pat); next = new int[

#include #include #include using namespace std; void Next(const string & pat,vector & next) { next.resize(pat.length()); if(pat.length() == 0) return; next[0] = -1; for(size_t pos = 1; pos

// The push-relable algorithm code due to CLRS chapter 26 #include #include using namespace std; const int N = 100; int n; // vertex number int e[N]; // residual flow of the vertex int h[N]; // height

#include #include #include #include #include #include #include #include #include using namespace std; const int INF = INT_MAX; //Edmond Karp. bool EK_bfs(vector > &G, int src, int dest, vector &Pr

#include #include #include #include #include using namespace std; const int MAXN = 120; const int INF = INT_MAX; int G[MAXN][MAXN], N; int dist[MAXN], Pre[MAXN]; bool visited[MAXN]; int times = 0

背包问题的一个应用: 题目背景:从N个数中找出若干个数使它们的和为M,输出满足条件的数组,并统计数组的数目这是一个查找的问题. 用dfs的话,本人代码如下:#include<stdio.h> #include<string.h> #include<sys/time.h>#define NEXT {\ ++i; \ p[i] = 0;\ continue;}#defi

#include #include #include using namespace std; template void quicksort(vector& a, int left, int right, vector& next) { int L = left, R = right; eT T = a[L]; while (L < R) { while (a[R] >= T &&