<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[java后端程序猿日常总结]]></title><description><![CDATA[在日常工作中对微服务，云服务，数据库思考总结，或者看到不错的技术文档进行分享。]]></description><link>https://blog.youkuaiyun.com/zero_zp</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; zero_zp]]></copyright><item><title><![CDATA[Redisson分布式锁的静态方式和springboot管理方式两种实现]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/128947039</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/128947039</guid><author>zero_zp</author><pubDate>Thu, 09 Feb 2023 09:37:59 +0800</pubDate><description><![CDATA[采用静态和springboot管理两种方式实现分布式锁，springboot管理方式采用泛型和函数式编程思想可以很好的兼容各种使用分布式锁的场景。]]></description><category></category></item><item><title><![CDATA[L2-028 秀恩爱分得快]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/88838670</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/88838670</guid><author>zero_zp</author><pubDate>Wed, 27 Mar 2019 10:45:42 +0800</pubDate><description><![CDATA[古人云：秀恩爱，分得快。

互联网上每天都有大量人发布大量照片，我们通过分析这些照片，可以分析人与人之间的亲密度。如果一张照片上出现了 K 个人，这些人两两间的亲密度就被定义为 1/K。任意两个人如果同时出现在若干张照片里，他们之间的亲密度就是所有这些同框照片对应的亲密度之和。下面给定一批照片，请你分析一对给定的情侣，看看他们分别有没有亲密度更高的异性朋友？

输入格式：

输入在第一行给出 2 ...]]></description><category></category></item><item><title><![CDATA[poj 2185 Milking Grid（二维KMP+next循环节）]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/81433456</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/81433456</guid><author>zero_zp</author><pubDate>Sun, 05 Aug 2018 17:54:15 +0800</pubDate><description><![CDATA[Milking Grid

Time Limit: 3000MS
			 
			Memory Limit: 65536K
		Total Submissions: 9708
			 
			Accepted: 4230
		Description

Every morning when they are milked, the Farmer John's cows form a rectangu...]]></description><category></category></item><item><title><![CDATA[hdu 3363 Ice-sugar Gourd(转换+尺取)]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/81290023</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/81290023</guid><author>zero_zp</author><pubDate>Mon, 30 Jul 2018 18:35:30 +0800</pubDate><description><![CDATA[Ice-sugar Gourd

Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1754    Accepted Submission(s): 579
 

Problem Description

Ice-sugar gourd, “...]]></description><category></category></item><item><title><![CDATA[hdu 5289 Assignment (四种解法)]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/81274214</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/81274214</guid><author>zero_zp</author><pubDate>Sun, 29 Jul 2018 20:03:24 +0800</pubDate><description><![CDATA[Assignment

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 4863    Accepted Submission(s): 2257
 

Problem Description

Tom owns a company and...]]></description><category></category></item><item><title><![CDATA[hdu 1540 Tunnel Warfare（线段树+区间合并）]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/81260177</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/81260177</guid><author>zero_zp</author><pubDate>Sat, 28 Jul 2018 13:34:14 +0800</pubDate><description><![CDATA[Tunnel Warfare

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12244    Accepted Submission(s): 4794
 

Problem Description

During the War of...]]></description><category></category></item><item><title><![CDATA[nyoj 460-项链]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/80364612</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/80364612</guid><author>zero_zp</author><pubDate>Fri, 18 May 2018 15:10:58 +0800</pubDate><description><![CDATA[460-项链 内存限制:64MB                         时间限制:1000ms                         Special Judge: No题目描述:在Mars星球上，每个Mars人都随身佩带着一串能量项链。在项链上有N颗能量珠。能量珠是一颗有头标记与尾标记的珠子，这些标记对应着某个正整数。并且，对于相邻的两颗珠子，前一颗珠子的尾标记一定等于后一颗珠...]]></description><category></category></item><item><title><![CDATA[2018 湘潭邀请赛 B.Higher h-index]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/80358728</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/80358728</guid><author>zero_zp</author><pubDate>Fri, 18 May 2018 00:08:40 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;
using namespace std;
int main ()
{
    int  a,b;
    while(cin&amp;gt;&amp;gt;a&amp;gt;&amp;gt;b)
    {
        cout&amp;lt;&amp;lt;(a+b)/2&amp;lt;&amp;lt;endl;
    }
    return 0;
}
]]></description><category></category></item><item><title><![CDATA[2018湘潭邀请赛 G.String Transformation]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/80348685</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/80348685</guid><author>zero_zp</author><pubDate>Thu, 17 May 2018 12:01:36 +0800</pubDate><description><![CDATA[题解：以c为分界点对每段消去aa bb abab，然后将两个字符串剩余的部分的集合（消去后每段都是由a|b|ab|ba组成的）进行比较，若两个集合相同则说明可以相互转化。（ab-&amp;gt;aababb-&amp;gt;babb-&amp;gt;ba）所以ab和ba一样推出abab...ab和baba...ba一样。把abab看成dd,我们任务就是消除形如aa的子串，这本质上可以看成a^0=a ,a^a=0，b^a^...]]></description><category></category></item><item><title><![CDATA[2018 湘潭邀请赛 F.Sorting]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/80334967</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/80334967</guid><author>zero_zp</author><pubDate>Wed, 16 May 2018 11:50:34 +0800</pubDate><description><![CDATA[思路一long double 精度可能不够，直接交叉相乘需要 6 × (2 × 10 9 ) 2 &amp;gt; 2 64 .转化为排序c ia i +b i +c i ，交叉相乘只需要3 × (2 × 10 9 ) 2 &amp;lt; 2 64记得：一定记得一定是：long double;#include &amp;lt;iostream&amp;gt;
#include &amp;lt;algorithm&amp;gt;
#includ...]]></description><category></category></item><item><title><![CDATA[2018 湘潭邀请赛 A.Easy h-index]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/80333760</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/80333760</guid><author>zero_zp</author><pubDate>Wed, 16 May 2018 10:47:51 +0800</pubDate><description><![CDATA[从⼤到⼩枚举 h#include &amp;lt;iostream&amp;gt;
using namespace std;
int a[200005];
int main ()
{
    int n;
    while(cin&amp;gt;&amp;gt;n)
    {
        for (int i=0;i&amp;lt;=n;i++)
            cin&amp;gt;&amp;gt;a[i];
        long...]]></description><category></category></item><item><title><![CDATA[2018 湘潭邀请赛 K.2018]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/80314544</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/80314544</guid><author>zero_zp</author><pubDate>Mon, 14 May 2018 20:22:09 +0800</pubDate><description><![CDATA[K. 20182018 的约数只有 4 个，可以算出区间内和 2018 的最⼤公约数是1, 2, 1009, 2018 的各有⼏个，之后 4 × 4 枚举统计答案。#include &amp;lt;iostream&amp;gt;
using namespace std;
int main ()
{
    int a,b,c,d;
    while(cin&amp;gt;&amp;gt;a&amp;gt;&amp;gt;b&amp;gt;&amp;gt;c...]]></description><category></category></item><item><title><![CDATA[nyoj 1070-诡异的电梯【Ⅰ】]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/80283544</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/80283544</guid><author>zero_zp</author><pubDate>Fri, 11 May 2018 16:49:21 +0800</pubDate><description><![CDATA[1070-诡异的电梯【Ⅰ】内存限制:64MB 时间限制:1000ms Special Judge: Noaccepted:3 submit:9题目描述:新的宿舍楼有 N(1≤N≤100000) 层 and M(1≤M≤100000)个学生. 在新的宿舍楼里, 为了节约学生的时间也为了鼓励学生锻炼身体, 所以规定该宿舍楼里的电梯在相邻的两层之间是不会连续停下（即，如果在第2层停下就不能在第3层停下。...]]></description><category></category></item><item><title><![CDATA[nyoj 860-又见01背包]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/80281784</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/80281784</guid><author>zero_zp</author><pubDate>Fri, 11 May 2018 15:08:13 +0800</pubDate><description><![CDATA[860-又见01背包内存限制:64MB 时间限制:1000ms Special Judge: Noaccepted:2 submit:11题目描述:    有n个重量和价值分别为wi 和 vi 的 物品，从这些物品中选择总重量不超过 W 的物品，求所有挑选方案中物品价值总和的最大值。　　1 &amp;lt;= n &amp;lt;=100　　1 &amp;lt;= wi &amp;lt;= 10^7　　1 &amp;lt;= vi &amp;l...]]></description><category></category></item><item><title><![CDATA[nyoj 214-单调递增子序列(二)]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/80279061</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/80279061</guid><author>zero_zp</author><pubDate>Fri, 11 May 2018 11:32:55 +0800</pubDate><description><![CDATA[214-单调递增子序列(二)内存限制:64MB 时间限制:1000ms Special Judge: Noaccepted:3 submit:16题目描述:给定一整型数列{a1,a2...,an}（0&amp;lt;n&amp;lt;=100000），找出单调递增最长子序列，并求出其长度。如：1 9 10 5 11 2 13的最长单调递增子序列是1 9 10 11 13，长度为5。输入描述:有多组测试数据（&amp;lt...]]></description><category></category></item><item><title><![CDATA[nyoj 220-推桌子]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/80273317</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/80273317</guid><author>zero_zp</author><pubDate>Thu, 10 May 2018 20:42:17 +0800</pubDate><description><![CDATA[220-推桌子内存限制:64MB 时间限制:1000ms Special Judge: Noaccepted:2 submit:5题目描述:The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floo...]]></description><category></category></item><item><title><![CDATA[nyoj 入门级dp题目题解集]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/80259448</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/80259448</guid><author>zero_zp</author><pubDate>Wed, 09 May 2018 23:16:03 +0800</pubDate><description><![CDATA[79-拦截导弹内存限制:64MB 时间限制:3000ms Special Judge: Noaccepted:1 submit:2题目描述:某国为了防御敌国的导弹袭击，发展中一种导弹拦截系统。但是这种导弹拦截系统有一个缺陷：虽然它的第一发炮弹能够到达任意的高度，但是以后每一发炮弹都不能高于等于前一发的高度。某天，雷达捕捉到敌国导弹来袭。由于该系统还在试用阶段，所以只用一套系统，因此有可能不能拦截所...]]></description><category></category></item><item><title><![CDATA[C - たくさんの数式 / Many Formulas]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/80250673</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/80250673</guid><author>zero_zp</author><pubDate>Wed, 09 May 2018 11:02:06 +0800</pubDate><description><![CDATA[C - たくさんの数式 / Many FormulasTime limit : 2sec / Memory limit : 256MBScore : 300 pointsProblem StatementYou are given a string S consisting of digits between 1 and 9, inclusive. You can insert the lette...]]></description><category></category></item><item><title><![CDATA[畅通工程经典例题（并查集+最小生成树+dij）hdu]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/80233070</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/80233070</guid><author>zero_zp</author><pubDate>Mon, 07 May 2018 23:07:28 +0800</pubDate><description><![CDATA[畅通工程Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 64340    Accepted Submission(s): 34421Problem Description某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连...]]></description><category></category></item><item><title><![CDATA[bfs培训例题题解]]></title><link>https://blog.youkuaiyun.com/zero_zp/article/details/80216011</link><guid>https://blog.youkuaiyun.com/zero_zp/article/details/80216011</guid><author>zero_zp</author><pubDate>Sun, 06 May 2018 17:16:48 +0800</pubDate><description><![CDATA[迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 30441 Accepted: 17504Description定义一个二维数组： int maze[5][5] = {

	0, 1, 0, 0, 0,

	0, 1, 0, 1, 0,

	0, 0, 0, 0, 0,

	0, 1, 1, 1, 0,

	0, 0, 0...]]></description><category></category></item></channel></rss>