zoj 2778 - Triangular N-Queens Problem

【zoj 2778 - Triangular N-Queens Problem】的更多相关文章

zoj 2778 - Triangular N-Queens Problem

题目:在三角形的棋盘上放n皇后问题. 分析:找规律题目.依照题目的输出,能够看出构造法则: 先填奇数,后填偶数.以下我们仅仅要证明这样的构造的存在性就可以. 解法:先给出集体构造方法,从(1.n-f(n)+1) 開始填充奇数点: 填充全部的(1+2k.n-f(n)+1+k){当中f(n)就是最大填充数.1+2k<=n-f(n)+1+k} . 之后開始从(2.n-f(n)+1+k+1)開始填充偶数点,因为奇数点仅仅能攻击奇数点. 偶数点仅仅能攻击偶数点,所以仅仅要保证每行一个皇后就能够了. 证明:…

【算法】N Queens Problem

/* ** 目前最快的N皇后递归解决方法 ** N Queens Problem ** 试探-回溯算法,递归实现 */ #include "stdafx.h" #include "iostream" #include <math.h> using namespace std; #include "time.h" // sum用来记录皇后放置成功的不同布局数:upperlim用来标记所有列都已经放置好了皇后. , upperlim =…

ZOJ 3686 A Simple Tree Problem

A Simple Tree Problem Time Limit: 3 Seconds Memory Limit: 65536 KB Given a rooted tree, each node has a boolean (0 or 1) labeled on it. Initially, all the labels are 0. We define this kind of operation: given a subtree, negate all its labels. An…

zoj 2818 Root of the Problem

Root of the Problem Time Limit: 2 Seconds Memory Limit: 65536 KB Given positive integers B and N, find an integer A such that AN is as close as possible to B. (The result A is an approximation to the Nth root of B.) Note that AN may be less than…

zoj 3686 A Simple Tree Problem （线段树）

Solution: 根据树的遍历道的时间给树的节点编号,记录下进入节点和退出节点的时间.这个时间区间覆盖了这个节点的所有子树,可以当做连续的区间利用线段树进行操作. /* 线段树 */ #pragma comment(linker, "/STACK:102400000,102400000") #include <iostream> #include <cstdio> #include <cstring> #include <cmath>…

zoj 2818 Root of the Problem（数学思维题）

题目链接: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2818 题目描述: Given positive integers B and N, find an integer A such that AN is as close as possible to B. (The result A is an approximation to the Nth root of B.) Note that AN may be l…

ZOJ 3686 A Simple Tree Problem（线段树）

Description Given a rooted tree, each node has a boolean (0 or 1) labeled on it. Initially, all the labels are 0. We define this kind of operation: given a subtree, negate all its labels. And we want to query the numbers of 1's of a subtree. Input Mu…