<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a315788533</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a315788533]]></copyright><item><title><![CDATA[java 线程池场景]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885737</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885737</guid><author>a315788533</author><pubDate>Sat, 20 Jan 2018 11:56:00 +0800</pubDate><description><![CDATA[java 一共含有四种线程池： newCachedThreadPool, newFixedThreadPool, newSingleThreadExecutor, newScheduledThreadPool。
newCachedThreadPool：顾名思义是一种可缓存的线程池， 线程池除了维护初始大小的线程外，当任务数量超出线程池大小时，便会新建线程， 而且当线程完成任务之后不会马...]]></description><category></category></item><item><title><![CDATA[angularJs 变量会有类型之分]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885736</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885736</guid><author>a315788533</author><pubDate>Wed, 27 Dec 2017 16:41:00 +0800</pubDate><description><![CDATA[&lt;select  ng-model="inventory.vegetableId+''" ng-options="vegetable.id as vegetable.name for vegetable in vegetables"&gt;    &lt;option value=""&gt;--- 蔬菜 ---&lt;/option&gt;&lt;/select&gt;当inve...]]></description><category></category></item><item><title><![CDATA[对OutOfMemoryError的排查]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885734</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885734</guid><author>a315788533</author><pubDate>Tue, 26 Dec 2017 09:57:00 +0800</pubDate><description><![CDATA[今早配置项目环境，启动tomcat后，访问主页面 后台出现java.lang.OutOfMemoryError: Java heap space 。
依照正常的思维，调大jvm堆的大小，修改tomcat/bin/catalina.sh 加上 set java_opts=-Xms512m -Xmx4096m ，随后启动项目时，出现 ubable to ping server local...]]></description><category></category></item><item><title><![CDATA[POJ 1442 -- Black Box(大小堆，优先队列)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885732</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885732</guid><author>a315788533</author><pubDate>Sat, 19 Nov 2016 16:58:00 +0800</pubDate><description><![CDATA[Description

Our Black Box represents a primitive database. It can save an integer array and has a special i variable. At the initial moment Black Box is empty and i equals 0. This Black Box ...]]></description><category></category></item><item><title><![CDATA[Codeforces Beta Round #1 C.Ancient Berland Circus]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885730</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885730</guid><author>a315788533</author><pubDate>Fri, 10 Jun 2016 21:54:00 +0800</pubDate><description><![CDATA[C. Ancient Berland Circustime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputNowadays all circuses in Berland have a round arena with diameter 13 ...]]></description><category></category></item><item><title><![CDATA[lightoj-1013 - Love Calculator(lcs变体)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885729</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885729</guid><author>a315788533</author><pubDate>Thu, 09 Jun 2016 13:09:00 +0800</pubDate><description><![CDATA[1013 - Love Calculator     	PDF (English)	Statistics	ForumTime Limit: 2 second(s)	Memory Limit: 32 MBYes, you are developing a 'Love calculator'. The software would be quite complex such that nob...]]></description><category></category></item><item><title><![CDATA[lightoj-1147 - Tug of War(状压dp)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885728</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885728</guid><author>a315788533</author><pubDate>Wed, 08 Jun 2016 23:44:00 +0800</pubDate><description><![CDATA[1147 - Tug of War     	PDF (English)	Statistics	ForumTime Limit: 4 second(s)	Memory Limit: 32 MBA tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must ...]]></description><category></category></item><item><title><![CDATA[lightoj-1193 - Dice (II)(dp+前缀和)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885726</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885726</guid><author>a315788533</author><pubDate>Wed, 08 Jun 2016 01:46:00 +0800</pubDate><description><![CDATA[1193 - Dice (II)     	PDF (English)	Statistics	ForumTime Limit: 3 second(s)	Memory Limit: 32 MBYou have N dices; each of them has K faces numbered from 1 to K. Now you can arrange the N dices in ...]]></description><category></category></item><item><title><![CDATA[lightoj-1110 - An Easy LCS (LCS+路径记录)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885724</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885724</guid><author>a315788533</author><pubDate>Wed, 08 Jun 2016 01:03:00 +0800</pubDate><description><![CDATA[1110 - An Easy LCS     	PDF (English)	Statistics	ForumTime Limit: 2 second(s)	Memory Limit: 32 MBLCS means 'Longest Common Subsequence' that means two non-empty strings are given; you have to fin...]]></description><category></category></item><item><title><![CDATA[lightoj-1145 - Dice (I)(dp计数)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885707</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885707</guid><author>a315788533</author><pubDate>Tue, 07 Jun 2016 13:59:00 +0800</pubDate><description><![CDATA[1145 - Dice (I)     	PDF (English)	Statistics	ForumTime Limit: 2 second(s)	Memory Limit: 32 MBYou have N dices; each of them has K faces numbered from 1 to K. Now you have arranged the N dices in...]]></description><category></category></item><item><title><![CDATA[lightoj-1050 - Marbles(dp)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885750</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885750</guid><author>a315788533</author><pubDate>Tue, 07 Jun 2016 00:00:00 +0800</pubDate><description><![CDATA[1050 - Marbles     	PDF (English)	Statistics	ForumTime Limit: 2 second(s)	Memory Limit: 32 MBYour friend Jim has challenged you to a game. He has a bag containing red and blue marbles. There will...]]></description><category></category></item><item><title><![CDATA[lightoj-1305 - Area of a Parallelogram(几何)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885749</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885749</guid><author>a315788533</author><pubDate>Mon, 06 Jun 2016 17:53:00 +0800</pubDate><description><![CDATA[1305 - Area of a Parallelogram     	PDF (English)	Statistics	ForumTime Limit: 1 second(s)	Memory Limit: 32 MBA parallelogram is a quadrilateral with two pairs of parallel sides. See the picture b...]]></description><category></category></item><item><title><![CDATA[lightoj-1354 - IP Checking(水题)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885721</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885721</guid><author>a315788533</author><pubDate>Mon, 06 Jun 2016 15:47:00 +0800</pubDate><description><![CDATA[1354 - IP Checking     	PDF (English)	Statistics	ForumTime Limit: 2 second(s)	Memory Limit: 32 MBAn IP address is a 32 bit address formatted in the following way
a.b.c.d
where a, b, c, d are in...]]></description><category></category></item><item><title><![CDATA[lightoj-1433 - Minimum Arc Distance(几何)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885748</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885748</guid><author>a315788533</author><pubDate>Mon, 06 Jun 2016 14:49:00 +0800</pubDate><description><![CDATA[1433 - Minimum Arc Distance     	PDF (English)	Statistics	ForumTime Limit: 2 second(s)	Memory Limit: 32 MBYou all probably know how to calculate the distance between two points in two dimensional...]]></description><category></category></item><item><title><![CDATA[lightoj-1227 - Boiled Eggs(贪心)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885718</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885718</guid><author>a315788533</author><pubDate>Mon, 06 Jun 2016 14:33:00 +0800</pubDate><description><![CDATA[1227 - Boiled Eggs     	PDF (English)	Statistics	ForumTime Limit: 0.5 second(s)	Memory Limit: 32 MBThree of the trouble-makers went to Malaysia this year. A rest house was booked for them. Unlike...]]></description><category></category></item><item><title><![CDATA[lightoj-1189 - Sum of Factorials(贪心)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885747</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885747</guid><author>a315788533</author><pubDate>Sun, 05 Jun 2016 19:03:00 +0800</pubDate><description><![CDATA[1189 - Sum of Factorials     	PDF (English)	Statistics	ForumTime Limit: 0.5 second(s)	Memory Limit: 32 MBGiven an integer n, you have to find whether it can be expressed as summation of factorial...]]></description><category></category></item><item><title><![CDATA[lightoj-1182 - Parity(位运算)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885746</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885746</guid><author>a315788533</author><pubDate>Sun, 05 Jun 2016 17:10:00 +0800</pubDate><description><![CDATA[1182 - Parity     	PDF (English)	Statistics	ForumTime Limit: 0.5 second(s)	Memory Limit: 32 MBGiven an integer n, first we represent it in binary. Then we count the number of ones. We say n has o...]]></description><category></category></item><item><title><![CDATA[lightoj-1011 - Marriage Ceremonies(状压dp)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885716</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885716</guid><author>a315788533</author><pubDate>Sun, 05 Jun 2016 12:03:00 +0800</pubDate><description><![CDATA[1011 - Marriage Ceremonies     	PDF (English)	Statistics	ForumTime Limit: 2 second(s)	Memory Limit: 32 MBYou work in a company which organizes marriages. Marriages are not that easy to be made, s...]]></description><category></category></item><item><title><![CDATA[lightoj-1009 - Back to Underworld(dfs+仿二分图染色)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885713</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885713</guid><author>a315788533</author><pubDate>Sat, 04 Jun 2016 22:57:00 +0800</pubDate><description><![CDATA[1009 - Back to Underworld     	PDF (English)	Statistics	ForumTime Limit: 4 second(s)	Memory Limit: 32 MBThe Vampires and Lykans are fighting each other to death. The war has become so fierce that...]]></description><category></category></item><item><title><![CDATA[lightoj-1023 - Discovering Permutations(全排列)]]></title><link>https://blog.youkuaiyun.com/a315788533/article/details/101885709</link><guid>https://blog.youkuaiyun.com/a315788533/article/details/101885709</guid><author>a315788533</author><pubDate>Wed, 01 Jun 2016 23:08:00 +0800</pubDate><description><![CDATA[1023 - Discovering Permutations     	PDF (English)	Statistics	ForumTime Limit: 0.5 second(s)	Memory Limit: 32 MBIn this problem you have to find the permutations using the first N English capital...]]></description><category></category></item></channel></rss>