FFOYeah的博客

1.八皇后问题

题目1：二分查找局部最小值 Description：定义局部最小的概念。arr 长度为1时，arr[0] 是局部最小。arr的长度为 N(N > 1) 时，如果 arr[0] < arr[1]，那么 arr[0] 是局部最小；如果 arr[N-1] < arr[N-2]，那么 arr[N-1] 是局部最小；如果 0 < i< N-1，既有 arr[i] &...

题目链接：http://bailian.openjudge.cn/practice/2749/描述给出一个正整数a，要求分解成若干个正整数的乘积，即a = a1 * a2 * a3 * ... * an，并且1 < a1 <= a2 <= a3 <= ... <= an，问这样的分解的种数有多少。注意到a = a也是一种分解。输入第1行是测试数据的组数...

题目链接B. Alyona and a treetime limit per test  2 secondsmemory limit per test  256 megabytesinput  standard inputoutput  standard outputAlyona has a tree with n vertices. The root of the tre...

题目链接C. Ilya And The Treetime limit per test 2 secondsmemory limit per test 256 megabytesIlya is very fond of graphs, especially trees. During his last trip to the forest Ilya found a very inte...

Codeforces Round #403 CAndryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them. The park consists of n squares connected

题目链接：https://codeforces.com/contest/839/problem/CC. JourneyThere are n cities and n - 1 roads in the Seven Kingdoms, each road connects two cities and we can reach any city from any other by the roa...

题目链接Berland scientists face a very important task - given the parts of short DNA fragments, restore the dinosaur DNA! The genome of a berland dinosaur has noting in common with the genome that we’ve ...

比赛传送门A. Nicoleta and the circle of kidsDescription每个人可以连边，最远连到第（i+k）%n 个人，边权为两个人之间的距离，求最大生成树Range1 ≤ K < N ≤ 1e9Solution方案一：LCM如果每个人都选取最优的连边策略，假设在人数可以无限扩大的前提下，那么每个人都可以向接下来的第k个人连边，很容易得出一个循环节...