tizzi的博客_DP,ac自动机,POJ

Knapsack problem FZU - 2214 背包

一、内容Given a set of n items, each with a weight w[i] and a value v[i], determine a way to cho

#include

i++

ide

原创 2022-01-06 18:00:10 118 阅读

CD UVA - 624

一、内容 You have a long drive by car ahead. You have a tape recorder, but unfortunately your

sed

#include

i++

原创 2022-01-06 17:59:31 314 阅读

实验四：子集和问题

一、内容子集和问题的一个实例为<S，c>。其中，S={x1，x2，...，xn}是一个正整数的集合，c是一个正整数。子集和问题判定是否存在S的一个子集S

搜索

i++

#include

原创 2022-01-06 17:58:51 187 阅读

Yet Another Monster Killing Problem CodeForces - 1257D

一、内容You play a computer game. In this game, you lead a party of m heroes, and you hav

i++

#include

sed

原创 2022-01-06 17:57:46 69 阅读

John's trip POJ - 1041

一、内容Little Johnny has got a new car. He decided to drive around the town to visit his friends. Johnny wante

#include

i++

欧拉路径

原创 2022-01-06 17:57:34 226 阅读

CodeForces 1253 C. Sweets Eating DP

一、内容Tsumugi brought n delicious sweets to the Light Music Club. They are numbered from 1 to n, where

i++

#include

前缀和

原创 2022-01-06 17:57:22 105 阅读

Nearest Opposite Parity CodeForces - 1272E bfs

一、内容You are given an array a consisting of n integers. In one move, you can jump from the position i to the position i−ai (if 1≤i−ai) or to the position i+ai (if i+ai≤n).For each position i from 1 to...

i++

#include

数据

其他

原创 2022-01-06 17:53:15 84 阅读

CodeForces - 1263E 线段树

一、内容The development of a text editor is a hard problem. You need to implement an extra module for brackets coloring in text.Your editor consists of a line with infinite length and cursor, which point...

前缀和

区间和

子树

其他

原创 2022-01-06 17:53:15 140 阅读

Piggy-Bank POJ - 1384 完全背包

一、内容Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The idea behind is s...

ide

#include

#define

其他

原创 2022-01-06 17:53:14 140 阅读

Dividing POJ - 1014 多重背包

一、内容题意：问给定值1-6的大理石若干个，问可以划分为一半吗。二、思路二进制优化多重背包，凑出所有大理石和一半的值，若能凑出代表能划分。三、代码#include <cstdio>#include <cstring>#define max(a, b) (a > b ? a : b)using namespace std;const int N...

ide

i++

#include

其他

原创 2022-01-06 17:53:14 74 阅读

Beautiful Rectangle CodeForces - 1277F

一、内容题意：凑出每行每列的元素都不相同的最大矩阵（元素最多）。二、思路由于每行不能一样，所以我们选取i行，那么最多可以选取i个相同的值。列可以随意增加，行需要限制一下。三、代码#include <cstdio>#include <algorithm>using namespace std;const int N = 4e5 + 5;struct n...

i++

#include

多列

其他

原创 2022-01-06 17:47:35 118 阅读

Two Fairs CodeForces - 1277E dfs

一、内容There are n cities in Berland and some pairs of them are connected by two-way roads. It is guaranteed that you can pass from any city to any other, moving along the roads. Cities are numerated fr...

i++

连通图

5e

其他

原创 2022-01-06 17:47:35 193 阅读

Frogger POJ - 2253 Floyd

一、内容湖中有n块石头，编号从1到n，有两只青蛙，Bob在1号石头上，Alice在2号石头上，Bob想去看望Alice，但由于水很脏，他想避免游泳，于是跳着去找她。但是Alice的石头超出了他的跳跃范围。因此，Bob使用其他石头作为中间站，通过一系列的小跳跃到达她。两块石头之间的青蛙距离被定义为两块石头之间所有可能路径上的最小必要跳跃距离，某条路径的必要跳跃距离即这条路径中单次跳跃的最远跳跃距...

#include

i++

最小值

其他

原创 2022-01-06 17:47:34 110 阅读

Networking POJ - 1287 最小生成树

一、内容You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs...

#include

ide

sed

其他

原创 2022-01-06 17:47:34 89 阅读

Building a Space Station POJ - 2031

一、内容给定N个三维圆心及其半径（x,y,z,r）；求连通它们的最小生成树。两个球若相交视为连通。 N<101，坐标非负且小于100.000。Input多组输入，以0结束。Output最短连通距离，三位小数。Sample Input310.000 10.000 50.000 10.00040.000 10.000 50.000 10.00040.000 40.000...

#include

i++

最小生成树

其他

原创 2022-01-06 17:47:34 185 阅读

How Many Tables HDU - 1213

一、内容 Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each ot...

连通块

i++

#include

其他

原创 2022-01-06 17:47:33 51 阅读

COURSES POJ - 1469 匈牙利模板

一、内容Consider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P students th...

#include

ide

初始化

其他

原创 2022-01-06 17:47:33 147 阅读

Tram POJ - 1847 最短路变形

一、内容Tram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switch pointing to the one of the rails going out of the intersect...

#include

ios

最短路

其他

原创 2022-01-06 17:47:33 70 阅读

Constanze's Machine CodeForces - 1245C

一、内容Constanze is the smartest girl in her village but she has bad eyesight.One day, she was able to invent an incredible machine! When you pronounce

ide

#include

i++

原创 2022-01-06 17:45:08 100 阅读

AGTC POJ - 3356

一、内容Let x and y be two strings over some finite alphabet A. We would like to transform x into y allowing only operations given below: Deletion: a letter in x is missing in y at a corresponding p...

i++

字符串

#include

原创 2022-01-06 17:44:41 76 阅读

Remove One Element CodeForces - 1272D DP

一、内容You are given an array a consisting of n integers.You can remove at most one element from this arr

删除元素

状态转移

#include

原创 2022-01-06 17:44:09 78 阅读

计算机算法设计与分析第4版 (王晓东) 重点题

第一章算法概述算法算法是由若干指令组成的有序序列输入：0个或多个输出：至少一个确定性：每条指令是清晰

算法

结点

i++

#include

原创 2022-01-06 17:43:07 1994 阅读

Wireless Network POJ - 2236 并查集

一、内容An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless

#include

i++

并查集

原创 2022-01-06 17:35:42 89 阅读

Assign the task HDU - 3974 dfs序 +线段树

一、内容 There is a company that has N employees(numbered from 1 to N),every employee in the company has a

i++

#include

区间修改

原创 2022-01-06 17:32:45 75 阅读

Atlantis HDU - 1542 扫描线模板

一、内容 There are several ancient Greek texts that contain descriptions of the fabl

离散化

区间更新

#include

原创 2022-01-06 17:32:34 41 阅读

Codeforces 1277D. Let's Play the Words?

一、内容题意：给定几个01二进制字符串，问你可以翻转任意的字符串，让所有的字符串能够拼接起来，且所有的串都是惟一的（不重复）。二、思路

#include

字符串

i++

原创 2022-01-06 17:27:07 149 阅读

Suffix Three CodeForces - 1281A

一、内容二、思路简单进行最后一个字符判断。三、代码 #include <cstdio> const int N = 1005; char s[N]; int t, len; int main() { scanf("%d", &t); while (t--) { scanf("%s", s + 1); len = strlen(s + 1); //"po...

#include

其他

原创 2022-01-06 17:23:33 44 阅读

Make Them Odd CodeForces - 1277B

一、内容题意：将所有的偶数都变成奇数，问最少需要多少步。每次选定一个偶数，然后所有相同的数都除2. 二、思路如果当前的数不是偶数，就用map记录当前偶数，如果已经访问过就不用再除2了，如果没有访问过那么就一直除2。三、代码 #include <cstdio> #include <unordered_map> #include <algorithm> u...

#include

i++

其他

原创 2022-01-06 17:23:33 74 阅读

Azamon Web Services CodeForces - 1281B

一、内容题意：问最多替换一对字符后是否能够严格小于另一个串（相等不算作严格小于）二、思路当a作为c的前缀的时候，a比c小。我们只需要对a进行排序，然后找到与b（排序后的串）第一个不相等字符处，然后将a串这个位置换成b串的这个位置的字符。由于要变成最小的串，所以我们应该从a串的末尾进行查找，这样替换的串更小。三、代码 #include <cstdio> #include ...

#include

ios

i++

其他

原创 2022-01-06 17:23:32 55 阅读

Cut and Paste CodeForces - 1281C

一、内容 We start with a string s consisting only of the digits 1, 2, or 3. The length of s is denoted by |s|. For each i from 1 to |s|, the i-th character of s is denoted by siThere is one cursor. The cu...

字符串

git

字符串长度

其他

原创 2022-01-06 17:23:32 104 阅读

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客

wx6128822852caf的博客

Knapsack problem FZU - 2214 背包

CD UVA - 624

实验四：子集和问题

Yet Another Monster Killing Problem CodeForces - 1257D

John's trip POJ - 1041

CodeForces 1253 C. Sweets Eating DP

Nearest Opposite Parity CodeForces - 1272E bfs

CodeForces - 1263E 线段树

Piggy-Bank POJ - 1384 完全背包

Dividing POJ - 1014 多重背包

Beautiful Rectangle CodeForces - 1277F

Two Fairs CodeForces - 1277E dfs

Frogger POJ - 2253 Floyd

Networking POJ - 1287 最小生成树

Building a Space Station POJ - 2031

How Many Tables HDU - 1213

COURSES POJ - 1469 匈牙利模板

Tram POJ - 1847 最短路变形

Constanze's Machine CodeForces - 1245C

AGTC POJ - 3356

Remove One Element CodeForces - 1272D DP

计算机算法设计与分析第4版 (王晓东) 重点题

Wireless Network POJ - 2236 并查集

Assign the task HDU - 3974 dfs序 +线段树

Atlantis HDU - 1542 扫描线模板

Codeforces 1277D. Let's Play the Words?

Suffix Three CodeForces - 1281A

Make Them Odd CodeForces - 1277B

Azamon Web Services CodeForces - 1281B

Cut and Paste CodeForces - 1281C

欢迎