- 博客(21)
- 收藏
- 关注
RSS订阅原创 ZOJ 3870 Team Formation（异或运算）
题意：给出n个数，其中两个数的异或能大于他们本身。。好气啊aaa，思路都对了，可惜没弄出来，，不难发现换成二进制后，某个数的最高位在其他数对应的数位为0的话，肯定比这两个数要大。。只要先储存下所有数的位数QAQ~~，然后再循环判断后面位数为0的情况。。#include "string"#include "iostream"#include "cstdio"#include "c
2015-04-26 10:14:52
356
原创 The 12th Zhejiang Provincial Collegiate Programming Contest
水题6题。。。。不想多说了，B题也是爆炸爆炸，最后还是没想出来。A：水#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "set"#include "queue"#include "vector"#include "cctype"#include "ss
2015-04-25 19:08:55
252
原创 最短路模板合集~（Dij+Floyd+Spfa）
自己整理的最短路模板，，对于最短路问题主要就是难在构图方面~~ //Dijstravoid Dijstra(){ int i,j; for(i=0; i<n; ++i) { dis[i]=INF; vis[i]=0; } dis[1]=0; int v; for(i=1
2015-04-20 11:52:29
1706
原创 POJ 1511 Invitation Cards （spfa）
求到某点的来回最短距离，数据太大，要用spfa邻接矩阵存储，将两点互换再求一次最短路，所有距离和即为所求#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "set"#include "queue"#include "vector"#include "cctype
2015-04-19 10:13:41
326
原创 HDU 5206 Four Inages Strategy
#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "set"#include "queue"#include "vector"#include "cctype"#include "sstream"#include "cstdlib"#include "c
2015-04-18 21:48:58
676
1
转载 容斥原理
来源：http://www.cppblog.com/vici/archive/2011/09/05/155103.html 前言：这篇文章发表于http://e-maxx.ru/algo/inclusion_exclusion_principle，原文是俄语的。由于文章确实很实用，而且鉴于国内俄文资料翻译的匮乏，我下决心将其翻译之。由于俄语对我来说如同乱码，而用Google
2015-04-18 21:07:38
472
原创 ZOJ 2836 Number Puzzle （容斥原理）
理解的好辛苦啊，，ym final爷，几分钟就能A出来！！ 二进制真是好东西啊 #include "string"#include "iostream"#include "cstdio"#include "cmath"#include "set"#include "queue"#include "vector"#include "cctype"#inc
2015-04-18 21:05:39
367
原创 POJ 1860 Currency Exchange（spfa）
最短路水题，，如果货币在转换中能涨价就不用再判断了。。#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "set"#include "queue"#include "vector"#include "cctype"#include "sstream"#i
2015-04-18 10:23:15
327
转载 C++ Set常用用法
set集合容器：实现了红黑树的平衡二叉检索树的数据结构，插入元素时，它会自动调整二叉树的排列，把元素放到适当的位置，以保证每个子树根节点键值大于左子树所有节点的键值，小于右子树所有节点的键值；另外，还得保证根节点左子树的高度与右子树高度相等。平衡二叉检索树使用中序遍历算法，检索效率高于vector、deque和list等容器，另外使用中序遍历可将键值按照从小到大遍历出来。构造set集合主要
2015-04-18 08:59:43
389
原创 Dijstra与prim
Dijstra模板：const int MAXSIZE=100;const int INF=1000000;//除对角线外最初都要初始化为无穷int dist[MAXSIZE];void Dijkstra(int cost[][MAXSIZE],int n,int v)//求v到各个顶点的最短路径{ int i,j,k,min,set[MAXSIZE]; memset(
2015-04-16 21:21:58
337
原创 ZOJ 3861 Valid Pattern Lock
全排列之后筛选。。#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "set"#include "queue"#include "vector"#include "cctype"#include "sstream"#include "cstdlib"
2015-04-13 15:10:44
288
原创 ZOJ 3865 Superbot（BFS水题）
比赛的时候题意理解错了，不想多说什么了。。水题一道，，给你四个按钮，每次你可以选择不动，左右移动按钮，按钮每P秒右移一次，，水啊#include "stack"#include "cstdio"#include "iostream"#include "cmath"#include "set"#include "sstream"#include "cctype"#
2015-04-13 14:53:10
351
原创 POJ 3126 Prime Path （BFS）
#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "set"#include "queue"#include "vector"#include "cctype"#include "sstream"#include "cstdlib"#include "c
2015-04-09 21:40:18
294
原创 HDU 2612 Find a way （bfs）
简单题，，，#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "set"#include "queue"#include "vector"#include "cctype"#include "sstream"#include "cstdlib"#in
2015-04-07 19:28:30
278
原创 POJ 3984 迷宫问题 （bfs 水）
#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "set"#include "queue"#include "vector"#include "cctype"#include "sstream"#include "cstdlib"#include "c
2015-04-07 19:27:41
286
原创 POJ 2406 Power Strings（循环节）
#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "set"#include "queue"#include "vector"#include "cctype"#include "sstream"#include "cstdlib"#include "c
2015-04-06 21:56:36
278
原创 HDU 1698 Just a Hook（线段树成段更新）
#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "algorithm"#define INF 0x3f3f3f3f#define INFL 0x3f3f3f3f3f3f3f3fLLusing namespace std;typedef long long LL
2015-04-06 14:42:45
291
原创 HDU 1394 Minimum Inversion Number （线段树求逆序数 ）
#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "set"#include "queue"#include "vector"#include "cctype"#include "sstream"#include "cstdlib"#include "c
2015-04-05 09:54:31
279
原创 BestCoder Round #36 HDU 5199 Gunner
用map可以用&直接读取数据。。简直方便#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "algorithm"#define INF 0x3f3f3f3f#define INFL 0x3f3f3f3f3f3f3f3fLLusing namespace std;
2015-04-04 21:32:49
365
原创 CodeForces 7A Kalevitch and Chess
dfs都不需要，由于题目只给8*8的范围，所以直接暴力就好了。。。#include "string"#include "iostream"#include "cstdio"#include "cmath"#include "set"#include "queue"#include "vector"#include "cctype"#include "sstrea
2015-04-02 22:34:37
380
原创 CodeForces 7C Line （扩展欧几里得）
前面忘记修改gcd，一直求不出来。。。套套模板轻松水，，#include "string" #include "iostream" #include "cstdio" #include "cmath" #include "set" #include "queue" #include "vector" #include "cctype"
2015-04-02 22:33:02
376
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人