acm
文章平均质量分 79
Who_is_WZX
这个作者很懒,什么都没留下…
展开
-
hdu 1717 小数化分数2 (数学)
小数化分数2Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2022 Accepted Submission(s): 813Problem DescriptionRay 在数学课上听老师说,任何原创 2014-05-08 22:14:08 · 723 阅读 · 0 评论 -
orz
双射删串问题 0/1。。。给定操作2有何初始 0/1 串。。问有多少串是可达的。。给定一个 0/1 串可以对这个 0/1 串做如下操作:1. 删去第一个 0 (如果有 0 的话。2. 将一个 1 变成 0.。(如果这个 1 左边全是 1—— from gyz (Not used 这个等价于下面这种。。1. 删去末尾的 0 (如果是 0 的话2转载 2013-10-11 22:00:59 · 659 阅读 · 0 评论 -
计算几何
理论:http://mindlee.net/2011/11/27/computational-geometry/http://blog.chinaunix.net/uid-12127321-id-2957853.html//hdu 1392 凸包#include #include #include const double esp=1e-8;const lon原创 2013-07-18 10:41:10 · 483 阅读 · 0 评论 -
poj 测试数据
1、USACO2006年November题目和测试数据的网址http://ace.delos.com/NOV062007年open赛题目和测试数据的网址http://ace.delos.com/OPEN07以此类推2、日本ACM比赛http://www.acm-japan.org/http://icpc2010.honiden.nii.ac.jp/en/past-c转载 2013-09-06 21:27:35 · 588 阅读 · 0 评论 -
Maze zoj3652(bfs+记忆化+状态压缩)
DescriptionCelica is a brave person and believer of a God in the bright side. He always fights against the monsters that endanger humans. One day, he is asked to go through a maze to do a importan原创 2013-08-18 18:09:50 · 514 阅读 · 0 评论 -
BiliBili zoj 3645 (高斯消元,数学)
Submit Status Practice ZOJ 3645DescriptionShirai Kuroko is a Senior One student. Almost everyone in Academy City have super powers, and Kuroko is good at using it. Her ability is "Tele原创 2013-08-16 17:32:52 · 565 阅读 · 0 评论 -
poj 3855 Blast the Enemy! (计算几何)
D - Blast the Enemy!Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3855DescriptionA new computer game has just arrived and原创 2013-08-27 20:46:43 · 862 阅读 · 0 评论 -
Gao the Grid zoj3647(数论)
DescriptionA n * m grid as follow:Count the number of triangles, three of whose vertice must be grid-points.Note that the three vertice of the triangle must not be in a line(the right pi原创 2013-08-15 19:34:06 · 711 阅读 · 0 评论 -
Kitty's Game zoj3644(dp+stl)
DescriptionKitty is a little cat. She is crazy about a game recently.There are n scenes in the game(mark from 1 to n). Each scene has a number pi. Kitty's score will become least_common_multiple原创 2013-08-15 17:50:00 · 629 阅读 · 0 评论 -
专题
计算几何:http://blog.csdn.net/zsc09_leaf/article/details/6331809http://blog.csdn.net/accry/article/details/6070621 (半平面交)原创 2013-07-18 10:48:10 · 765 阅读 · 0 评论 -
!!!一些奇怪的东西
复杂度分析: http://www.cnblogs.com/bbsno1/archive/2013/08/12/3253759.html原创 2013-08-22 23:58:34 · 737 阅读 · 0 评论 -
HYSBZ - 1026 (数位dp)
windy数Time Limit: 1000MS Memory Limit: 165888KB 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] Descriptionwindy定义了一种windy数。 不含前导零且相邻两个数字之差至少为2的正原创 2014-05-06 21:08:42 · 628 阅读 · 0 评论 -
hdu 3652 B-number (数位dp+记忆化)
B-numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2143 Accepted Submission(s): 1152Problem DescriptionA wqb-number, or原创 2014-05-06 16:39:22 · 639 阅读 · 0 评论 -
模板(字符串)
ac自动机原创 2014-05-01 21:13:07 · 504 阅读 · 0 评论 -
hdu 1542 Atlantis (线段树+离散化+扫描线)
AtlantisTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5956 Accepted Submission(s): 2613Problem DescriptionThere are several原创 2014-03-02 19:39:24 · 544 阅读 · 0 评论 -
ACM之java速成
这里指的java速成,只限于java语法,包括输入输出,运算处理,字符串和高精度的处理,进制之间的转换等,能解决OJ上的一些高精度题目。1. 输入:格式为:Scanner cin = new Scanner (new BufferedInputStream(System.in));例程:import java.io.*;import java.math.*;impo转载 2013-12-02 23:47:08 · 423 阅读 · 0 评论 -
后缀数组学习笔记——罗穗骞倍增算法代码
后缀数组学习笔记——罗穗骞倍增算法代码 一开始看“小罗”写的论文和模板真的云里雾里,理解起来十分困难,后来结合一个百度贴吧里面的学习笔记总算是把倍增算法的代码的意思搞懂了,于是后面自己也写了一份对“小罗”倍增算法代码的注释,希望能对各位正在学习后缀数组的同僚带来一点帮助。 另附上百度贴吧那篇文章的链接:http://tieba.baidu.com/f?kz=75458029转载 2013-12-01 17:46:48 · 755 阅读 · 0 评论 -
HYSBZ - 1503 郁闷的出纳员 (treap)
HYSBZ - 1503郁闷的出纳员Time Limit: 5000MS Memory Limit: 65536KB 64bit IO Format: %lld & %llu[Submit] [Go Back] [Status] DescriptionOIER公司是一家大型专业化软件公司,有着原创 2013-12-01 16:29:04 · 656 阅读 · 0 评论 -
线性筛数法
我们知道合数可以由一个质数数与另一个数相乘得到而同时假设合数a=质数b×质数c×一个数d令e=c × d,假设b ≥ e,e为合数,令f=d × ba=f × c ,其中c即比一个合数数大的质数和该合数的乘积可用一个更大的合数和比其小的质数相乘得到这也是if(!( i % prime[j]))break;的含义,这也是线性筛法算质数表的关键所在利用了每个合数必有一个最小素因转载 2013-10-26 10:47:58 · 751 阅读 · 0 评论 -
两道容斥题
B - The Secret of IdentifierTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice URAL 1932DescriptionDavy Jones: You've been captain原创 2013-08-27 20:49:30 · 727 阅读 · 0 评论 -
Matrix Transformer zoj3646 (二分图最大匹配)
DescriptionAlice and Bob meet again. This time they play a game named MATRIX TRANSFORMER.They got an n * n board. Every grid has two positions, UP and DOWN. In this game you can push some amazin原创 2013-08-15 13:22:37 · 566 阅读 · 0 评论 -
ACM的算法(觉得很好,有层次感)
ACM的算法(觉得很好,有层次感)POJ上的一些水题(可用来练手和增加自信) (poj3299,poj2159,poj2739,poj1083,poj2262,poj1503,poj3006,poj2255,poj3094) 初期: 一.基本算法: (1)枚举. (poj1753,poj2965) (2)贪心(poj1328,poj2109,poj2586)转载 2013-08-24 19:18:21 · 659 阅读 · 0 评论 -
zoj 3686 A Simple Tree Problem(dfs+线段树)
A Simple Tree ProblemTime Limit: 3 Seconds Memory Limit: 65536 KBGiven a rooted tree, each node has a boolean (0 or 1) labeled on it. Initially, all the labels are 0.We define this kind原创 2013-07-31 12:46:58 · 508 阅读 · 0 评论 -
poj 1873 The Fortified Forest (暴力搜索+凸包求周长)
The Fortified ForestTime Limit: 1000MS Memory Limit: 30000KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionOnce upon a time, in原创 2013-07-23 20:33:50 · 565 阅读 · 0 评论 -
hdu 1700 (计算几何 向量的坐标变换)
DescriptionThere is a cycle with its center on the origin.Now give you a point on the cycle, you are to find out the other two points on it, to maximize the sum of the distance between each othe原创 2013-07-23 11:21:22 · 629 阅读 · 0 评论 -
fzu 2129 子序列个数 (dp)
Problem 2129 子序列个数Accept: 25 Submit: 63Time Limit: 2000 mSec Memory Limit : 32768 KB Problem Description子序列的定义:对于一个序列a=a[1],a[2],......a[n]。则非空序列a'=a[p1],a[p2]......a[pm]为a的一个子序列原创 2013-07-30 13:57:44 · 662 阅读 · 0 评论 -
zoj 3689 Digging (dp)
DiggingTime Limit: 2 Seconds Memory Limit: 65536 KBWhen it comes to the Maya Civilization, we can quickly remind of a term called the end of the world. It's not difficult to understand原创 2013-07-30 13:54:13 · 567 阅读 · 0 评论 -
最近公共祖先LCA:RMQ转化
1,最近公共祖先(LCA): 对于有根树T的两个结点u、v,最近公共祖先LCA(T,u,v)表示一个结点x,满足x是u、v的祖先且x的深度尽可能大。2,LCA问题向RMQ问题的转化方法:(RMQ返回最值的下标) 对树进行深度优先遍历,每当“进入”或回溯到某个结点时,将这个结点的深度存入数组dfsNum最后一位。同时记录结点i在数组中第一次出现的位置(事实上就是进入结点i时记录的位置),原创 2013-07-29 18:51:53 · 514 阅读 · 0 评论 -
hdu 2196 computer (树形dp)
ComputerTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1885 Accepted Submission(s): 934Problem DescriptionA school bought th原创 2013-07-21 15:53:16 · 544 阅读 · 0 评论 -
网络流(模板)
理论:http://mindlee.net/2011/11/19/network-flow///Edmonds-Karp(EK)hdu3549#include #include #include using namespace std;const int M=110;const int inf=1<<30;int capacity[M][M],flow[M],pre[M]原创 2013-07-20 12:42:11 · 515 阅读 · 0 评论 -
poj 1469 COURSES (二分图最大匹配)
COURSESTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15254 Accepted: 6013DescriptionConsider a group of N students and P courses. Each student visit原创 2013-07-25 12:58:51 · 450 阅读 · 0 评论 -
poj 2104 K-th Number(划分树)
K-th NumberTime Limit: 20000MS Memory Limit: 65536KTotal Submissions: 32249 Accepted: 10022Case Time Limit: 2000MSDescriptionYou are working for Macrohard原创 2013-07-31 18:43:59 · 519 阅读 · 0 评论 -
HDU 4565 So Easy!(数学+矩阵快速幂)
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4565Description A sequence S n is defined as: Where a, b, n, m are posit原创 2013-08-22 13:38:46 · 535 阅读 · 0 评论 -
UESTC 1709 Binary Operations (位运算)
SubmitStatusBest SolutionBackDescriptionBob has a sequence of N integers. They are so attractive, that Alice begs to have a continued part of it(a continued part he原创 2013-07-29 14:15:59 · 704 阅读 · 0 评论 -
UESTC 1711 Divide 解题报告
DivideTime Limit: 2000 ms Memory Limit: 65535 kB Solved: 30 Tried: 743SubmitStatusBest SolutionBackDescriptionAlice and Bob has found a island of tr原创 2013-07-28 00:08:57 · 945 阅读 · 0 评论 -
POJ - 1155 TELE(树形dp)
TELETime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionA TV-network plans to broadcast an im原创 2013-07-27 17:32:48 · 462 阅读 · 0 评论 -
fzu1844 Earthquake Damage (网络流 最大流最小割/ISAP)
Earthquake DamageTime Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionOpen Source Tools help ear原创 2013-07-27 12:24:47 · 594 阅读 · 0 评论 -
模板库
叉姐:https://github.com/ftiasch/shokavain:https://github.com/Azure-Vani/acm-template原创 2013-07-26 00:08:04 · 420 阅读 · 0 评论 -
二分图最大匹配总结
原地址:http://www.cppblog.com/acronix/archive/2010/08/21/124175.html1。一个二分图中的最大匹配数等于这个图中的最小点覆盖数【转自Matirx67】二分图最大匹配的König定理及其证明 本文将是这一系列里最短的一篇,因为我只打算把König定理证了,其它的废话一概没有。 以下五个问题我可能会在以后转载 2013-07-25 22:59:40 · 372 阅读 · 0 评论 -
图论小结
图论小结1 拓扑排序:复杂度o(n+m)普通的拓扑排序没什么好说的,在一些特殊结构的拓扑图上(比如自动机,度有限制的图或树),结合最小表示法(我一般都是并查集+map)可以判图的同构推荐题:Poj3687 Uvalive3981 Ural18722 最短路 : a) bfs: 复杂度o(n+m),适用于边权为1的图b) 扩展bfs : 复杂度o(n+m),适用于转载 2013-07-26 12:58:51 · 612 阅读 · 0 评论