<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[accept_2333的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/accept_2333</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; accept_2333]]></copyright><item><title><![CDATA[2021-08-02]]></title><link>https://blog.csdn.net/accept_2333/article/details/119332580</link><guid>https://blog.csdn.net/accept_2333/article/details/119332580</guid><author>accept_2333</author><pubDate>Mon, 02 Aug 2021 19:53:44 +0800</pubDate><description><![CDATA[2021牛客暑期多校训练营5
J	Jewels
黄金水手在海底捞钻石，给的是一个三维的坐标，一颗钻石每秒向上飘vi米，求最小捞的时间。
网络流的spfa版最大流，超时
#include&lt;stdio.h&gt;
#include&lt;algorithm&gt;
#include&lt;iostream&gt;
#include&lt;cmath&gt;
#include&lt;queue&gt;
#include&lt;string&gt;
#include&lt;string.h&gt;
#defi]]></description><category></category></item><item><title><![CDATA[Cleaning Shifts POJ - 2376]]></title><link>https://blog.csdn.net/accept_2333/article/details/118795283</link><guid>https://blog.csdn.net/accept_2333/article/details/118795283</guid><author>accept_2333</author><pubDate>Fri, 16 Jul 2021 14:03:18 +0800</pubDate><description><![CDATA[Cleaning Shifts POJ - 2376
这题可以用线段树加dp
#include&lt;cstdio&gt;
#include&lt;algorithm&gt;
#include&lt;iostream&gt;
#include&lt;string.h&gt;
using namespace std;
int n,m,p,x,y,ans;
int t;
struct node
{
	int l,r,w;
}tree[4000001];
inline void build(int l,int r]]></description><category></category></item><item><title><![CDATA[Gym - 103117F]]></title><link>https://blog.csdn.net/accept_2333/article/details/117804242</link><guid>https://blog.csdn.net/accept_2333/article/details/117804242</guid><author>accept_2333</author><pubDate>Fri, 11 Jun 2021 09:23:35 +0800</pubDate><description><![CDATA[F - Direction Setting
The 2021 Sichuan Provincial Collegiate Programming Contest
题意如下：
多组输入，给你一个n,和一个m，下面一行n个数代表点的权值(ai)，下面m条无向边ui,vi。现在给无向边标方向，0是前向后，1是后向前，(di，为第i个点的入度)求D的最小值

网络流，最大流和费用流都可以，这里是最大流（因为费用流我没有写）：给边上方向的时候可以理解为选其中一个点的入度加一，然后我们要尽可能的将每个值的度数值都不大于]]></description><category></category></item><item><title><![CDATA[Palindrome subsequence HDU - 4632]]></title><link>https://blog.csdn.net/accept_2333/article/details/113421260</link><guid>https://blog.csdn.net/accept_2333/article/details/113421260</guid><author>accept_2333</author><pubDate>Sat, 30 Jan 2021 11:45:23 +0800</pubDate><description><![CDATA[Palindrome subsequence HDU - 4632
In mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements. For example, the sequence &lt;A, B, D&gt; is a subsequen]]></description><category></category></item><item><title><![CDATA[Monkey Party HDU - 3506]]></title><link>https://blog.csdn.net/accept_2333/article/details/113257128</link><guid>https://blog.csdn.net/accept_2333/article/details/113257128</guid><author>accept_2333</author><pubDate>Wed, 27 Jan 2021 17:32:59 +0800</pubDate><description><![CDATA[Far away from our world, there is a banana forest. And many lovely monkeys live there. One day, SDH(Song Da Hou), who is the king of banana forest, decides to hold a big party to celebrate Crazy Bananas Day. But the little monkeys don’t know each other, so]]></description><category></category></item><item><title><![CDATA[poj 2259]]></title><link>https://blog.csdn.net/accept_2333/article/details/113195010</link><guid>https://blog.csdn.net/accept_2333/article/details/113195010</guid><author>accept_2333</author><pubDate>Tue, 26 Jan 2021 21:33:15 +0800</pubDate><description><![CDATA[当一个元素增加进来之后，唯一变化的应该是有某一行的长度变长了，那么应该是需要用每一行的长度去
说到底就是不考虑数字放进去的顺序，只考虑状态怎么转移的；再此基础上还要考虑只有知道前面和左边的数字才能安放后面的数字
这里像下面这么写会m掉。但是我看到一个大佬这接在定义的时候限制因为数据不大，所以直接在函数里面定义比如cin&gt;&gt;x;  ll dp[x];
#define _CRT_SECURE_NO_WARNINGS
#include&lt;stdio.h&gt;
#include&lt;algori]]></description><category></category></item><item><title><![CDATA[POJ - 1179]]></title><link>https://blog.csdn.net/accept_2333/article/details/113095179</link><guid>https://blog.csdn.net/accept_2333/article/details/113095179</guid><author>accept_2333</author><pubDate>Sun, 24 Jan 2021 19:08:45 +0800</pubDate><description><![CDATA[POJ 1179
传送口
“多边形游戏”是一款单人益智游戏。
游戏开始时，给定玩家一个具有N个顶点N条边（编号1-N）的多边形，如图1所示，其中N = 4。
每个顶点上写有一个整数，每个边上标有一个运算符+（加号）或运算符*（乘号）。

第一步，玩家选择一条边，将它删除。
接下来在进行N-1步，在每一步中，玩家选择一条边，把这条边以及该边连接的两个顶点用一个新的顶点代替，新顶点上的整数值等于删去的两个顶点上的数按照删去的边上标有的符号进行计算得到的结果。
下面是用图1给出的四边形进行游戏的全过程。
1179]]></description><category></category></item><item><title><![CDATA[Unique Snowflakes UVA - 11572queue和sort尺取法，简单AC]]></title><link>https://blog.csdn.net/accept_2333/article/details/105461329</link><guid>https://blog.csdn.net/accept_2333/article/details/105461329</guid><author>accept_2333</author><pubDate>Sat, 11 Apr 2020 23:37:23 +0800</pubDate><description><![CDATA[Unique Snowflakes UVA - 11572
题目如下
Emily the entrepreneur has a cool business idea: packaging and selling snowflakes. She has devised a
machine that captures snowflakes as they fall, and serializes th...]]></description><category></category></item><item><title><![CDATA[HDU_1584 A strange lift:BFS]]></title><link>https://blog.csdn.net/accept_2333/article/details/105459946</link><guid>https://blog.csdn.net/accept_2333/article/details/105459946</guid><author>accept_2333</author><pubDate>Sat, 11 Apr 2020 22:02:24 +0800</pubDate><description><![CDATA[HDU_1584 A strange lift:BFS
There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 &lt;= Ki &lt;= N) on every floor.The lift have just two buttons: up and...]]></description><category></category></item></channel></rss>