![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法入门学习
hai2024
一个安卓通信人。
展开
-
1016
#include#define SIZE (100)#define INF ((1<<15) - 1)//#define DEBUG 0int N,K,R,O;int main(){ int cost[SIZE][SIZE] = {0}; int x,y;#ifdef DEBUG int map[SIZE][SIZE] = {0}; scanf("%d %d %d原创 2016-07-30 22:11:48 · 265 阅读 · 0 评论 -
1024
普里姆算法,Prim 最小生成树原创 2015-07-22 23:45:30 · 610 阅读 · 0 评论 -
1023
冰壶原创 2015-07-22 23:44:12 · 375 阅读 · 0 评论 -
1328
POJ 1328原创 2015-07-07 20:49:03 · 555 阅读 · 0 评论 -
1034
#includeusing namespace std;int main(){ const int N = 100; int i = 0; int j = 0; int x = 0; int y = 0; int size = 0;; int answer = 0; int vis[N][N] = {0}; int map[N][N] = {0}; int dis[4原创 2014-10-27 00:08:37 · 715 阅读 · 0 评论 -
1018
#includeusing namespace std;#define DEBUG_DFS = 1;const int SIZE = 8;int map[SIZE][SIZE] = {0};int size = 0;int Answer;int colsum;void getMaxSum(){ int i , j ; colsum = 0; int temp = 0;原创 2014-10-24 10:51:44 · 708 阅读 · 0 评论 -
1017
#if 1#include#define SIZE (101)#define DEBUG (1)int arr[SIZE];bool flag[SIZE];bool isOver;int count;bool isPrime(int num){ bool ret = true; for(int i = 2; i <= num/2; i++) { if(num %原创 2014-10-22 00:00:00 · 677 阅读 · 0 评论 -
1016
#include#define SIZE (100)#define INF ((1<<15) - 1)//#define DEBUG 0int N,K,R,O;int main(){ int cost[SIZE][SIZE] = {0}; int x,y;#ifdef DEBUG int map[SIZE][SIZE] = {0}; scanf("%d %d %d原创 2014-10-21 21:39:30 · 694 阅读 · 0 评论 -
1021
#include /*write on 2014-10-19 22:30*/#define M 101 #define N 101 #define DEBUG_IO (0) struct node { int x; int y; int step; }; int main() { int answer = 0; nod原创 2014-10-19 22:36:51 · 634 阅读 · 0 评论 -
1022冰壶
冰壶原创 2015-07-22 23:53:57 · 664 阅读 · 0 评论 -
1027
#include#define DEBUG_IO (0)const int MAX = 85;const int INF = 65535;bool isOver = false;int N, M;int answer;int n[MAX];int vis[MAX];void dfs(int m, int step){ if(m 0 && isOver == true &&原创 2015-07-27 21:48:07 · 387 阅读 · 0 评论 -
2531
#includeusing namespace std;const int SIZE = 21;int QA[SIZE] = {0};int QB[SIZE] = {0};int map[SIZE][SIZE] = {0};int N = 0;int tem = 0;int sum = 0;void dfs(int a, int b, int step);int ma原创 2015-07-27 21:48:43 · 482 阅读 · 0 评论 -
1026
#include #define DEBUG_IO (0) const int MAX = 1005; const int INF = 65535; typedef struct Node { int x; int age; Node():x(0),age(0){} }; enum Command { ADD_ONE = 1,原创 2016-07-30 22:08:44 · 266 阅读 · 0 评论 -
1038
#include #define DEBUG_IO (0) /* 1.选出存在1和相等的情况,单独处理 2.针对其余情况,用dfs进行全排列处理 1)用数组存储大小数若干,用最小和最大处理,推断边界条件 2)较小数取最大值,测试最大的值 */ const long INF = 70001; long ans[14] = {0}; bool vis[14] = {0};原创 2016-07-30 22:07:02 · 342 阅读 · 0 评论 -
1048
#include #include #define DEBUG_IO (0) #define DEBUG (0) using namespace std; const int N = 52; struct Node { int val; int step; }; int n; int step; int temp; Node map[N][N原创 2016-07-30 22:06:08 · 290 阅读 · 0 评论 -
1019
#include #include #define DEBUG_IO (0) const int MAX_SIZE = 55; struct Node { int c; Node* next; Node():c(0),next(NULL){} }; int main() { #if DEBUG_IO freopen("in原创 2016-07-30 22:04:44 · 258 阅读 · 0 评论 -
1032
#include #define DEBUG_IO (0) #define DEBUG_DP (1) #define MIN(a,b) ((a) > (b) ? (b):(a)) const int N = 1005; int main() { #if DEBUG_IO freopen("input.txt", "r", stdin); setbuf(s原创 2016-07-30 22:03:47 · 234 阅读 · 0 评论 -
1034
#include #include using namespace std; #define DEBUG_IO (0) #define DEBUG (0) struct Node { int x; int y; int s; Node():x(0),y(0),s(0) { } }; const int N =原创 2015-07-29 23:33:42 · 468 阅读 · 0 评论 -
1036
#include #define DEBUG_IO (0) const int N = 1002; char str[N]; int str_len; void quick_sort(char array[], int l, int r); int main() { #if DEBUG_IO freopen("input.txt", "r", stdin);原创 2015-07-29 23:33:30 · 384 阅读 · 0 评论 -
1025约瑟夫问题
#include #define DEBUG_IO (0) const int MAX = 1001; typedef struct Node { Node* next; int x; Node():next(0),x(0){} }; int main() { #if DEBUG_IO freopen("input.txt原创 2015-07-27 21:49:03 · 438 阅读 · 0 评论 -
1067
据点轰炸 动态规划原创 2016-10-14 17:26:42 · 905 阅读 · 0 评论