<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[我待程序如初见、、、]]></title><description><![CDATA[程序设计语言]]></description><link>https://blog.youkuaiyun.com/u011629906</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u011629906]]></copyright><item><title><![CDATA[URAL 1029]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10255737</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10255737</guid><author>u011629906</author><pubDate>Sat, 24 Aug 2013 12:01:27 +0800</pubDate><description><![CDATA[URAL 1029 Ministry ,来自Jsun_moon...]]></description><category></category></item><item><title><![CDATA[URAL 1501]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10254417</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10254417</guid><author>u011629906</author><pubDate>Sat, 24 Aug 2013 11:03:53 +0800</pubDate><description><![CDATA[URAL 1501.Sense of Beauty]]></description><category></category></item><item><title><![CDATA[URAL 1244]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10253157</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10253157</guid><author>u011629906</author><pubDate>Sat, 24 Aug 2013 10:39:26 +0800</pubDate><description><![CDATA[URAL 1244 Gentlemen]]></description><category></category></item><item><title><![CDATA[URAL 1036]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10252323</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10252323</guid><author>u011629906</author><pubDate>Sat, 24 Aug 2013 10:12:28 +0800</pubDate><description><![CDATA[URAL 1036 Lucky Tickets]]></description><category></category></item><item><title><![CDATA[URAL 1658]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10251023</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10251023</guid><author>u011629906</author><pubDate>Sat, 24 Aug 2013 09:54:58 +0800</pubDate><description><![CDATA[URAL 1658 Sum of Digits
题目大意：求出T个最小的满足各个位的和为S1,平方和为S2的数。按顺序输出。数的位数大于100或者不存在这样一个数时，输出：No solution。
Time Limit:2000MS     Memory
 Limit:65536KB     64bit IO Format:%I64d
 & %I64u

数据规模：T
理论基础：无。
题目分析：用dp[i][j]表示各个位的和为i]]></description><category></category></item><item><title><![CDATA[URAL 1018]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10249903</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10249903</guid><author>u011629906</author><pubDate>Sat, 24 Aug 2013 09:28:03 +0800</pubDate><description><![CDATA[题目大意：给一棵共有N个枝条的二叉苹果树，每个枝上有apple[i][j]个苹果，求保留Q个枝条时，能够留下的最大苹果数。
Time Limit:1000MS     Memory
 Limit:16384KB     64bit IO Format:%I64d
 & %I64u

数据规模：2
理论基础：无。
题目分析：树dp。我们首先将所有的苹果转移到朝向叶子节点方向的节点。再添]]></description><category></category></item><item><title><![CDATA[URAL 1741]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10233407</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10233407</guid><author>u011629906</author><pubDate>Fri, 23 Aug 2013 17:40:10 +0800</pubDate><description><![CDATA[题目大意：给出M个版本为：ai bi di type的升级包，ai表示使用此升级包时原软件的基础必须为ai，bi表示使用此升级包后可以到达的版本，di表示此升级包的大小(耗用的流量)，对应的是升级时间的长短，type分为三类，正版，盗版和破解版，正版只能装在正版上，盗版可以装在正版和盗版上，但是软件升级时一旦使用一次盗版后即为盗版。破解版既可以装在正版也可以装在盗版上，使用后不影响原软件性质。判断]]></description><category></category></item><item><title><![CDATA[URAL 1303]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10227637</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10227637</guid><author>u011629906</author><pubDate>Fri, 23 Aug 2013 16:23:58 +0800</pubDate><description><![CDATA[URAL 1303 Minimal Coverage]]></description><category></category></item><item><title><![CDATA[URAL 1117]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10223709</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10223709</guid><author>u011629906</author><pubDate>Fri, 23 Aug 2013 15:26:05 +0800</pubDate><description><![CDATA[题目大意：一颗深度不超过31的满二叉树，按照中根遍历编号，求从a，a+1,a+2,...依次走到b时跳过的层的总数（a为m,n中的较小的数，b为较大的数）。
例如:
input:           output:
1 5              2（1->2,2->3,3->4（跳过一层），4->5（跳过一层））
Time Limit:1000MS     Memory
 Limit]]></description><category></category></item><item><title><![CDATA[URAL 1081]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10221061</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10221061</guid><author>u011629906</author><pubDate>Fri, 23 Aug 2013 14:35:40 +0800</pubDate><description><![CDATA[URAL 1081 Binary Lexicographic Sequence
dp的思路，非dp解决方法、、、]]></description><category></category></item><item><title><![CDATA[URAL 1635]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10218447</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10218447</guid><author>u011629906</author><pubDate>Fri, 23 Aug 2013 13:46:50 +0800</pubDate><description><![CDATA[题目大意：给出一个长为n的仅由小写英文字母组成的字符串，求它的回文串划分的元素的最小个数，并按顺序输出此划分。所谓回文划分就是将原字符串拆分成若干个回文子字符串。
Time Limit:1000MS     Memory
 Limit:65536KB     64bit IO Format:%I64d
 & %I64u

数据规模：n
理论基础：回文串定义：“回文串”是一个正读和反读都]]></description><category></category></item><item><title><![CDATA[URAL 1183]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10212803</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10212803</guid><author>u011629906</author><pubDate>Fri, 23 Aug 2013 11:21:10 +0800</pubDate><description><![CDATA[URAL 1183 Brackets Sequence]]></description><category></category></item><item><title><![CDATA[URAL 1152]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10210667</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10210667</guid><author>u011629906</author><pubDate>Fri, 23 Aug 2013 10:31:06 +0800</pubDate><description><![CDATA[ural 1152 False Mirrors
题目大意:给出n个元素大小数组视为首尾相接，表示有n个可以对人造成a[i]点伤害的来源，一个人手中具有一种特殊的枪，每次只能打掉相邻的三个伤害来源，每打一次后，就会惊动其它的伤害来源，使其它每个伤害来源都会对此人造成对应的伤害。求此人最少会受到多大的伤害？
Time Limit:2000MS     Memory]]></description><category></category></item><item><title><![CDATA[URAL 1586]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10208575</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10208575</guid><author>u011629906</author><pubDate>Fri, 23 Aug 2013 09:58:06 +0800</pubDate><description><![CDATA[URAL 1586 Threeprime Numbers]]></description><category></category></item><item><title><![CDATA[URAL 1167]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10207519</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10207519</guid><author>u011629906</author><pubDate>Fri, 23 Aug 2013 09:25:47 +0800</pubDate><description><![CDATA[题目大意：有K个马厩，N匹只有两种颜色的马的序列，用0和1表示。当两种颜色的马同处一个马厩时就会产生不和谐指数，不和谐指数为两种马的数量之积，马只能按照顺序进入马厩，而且只有当一个马厩确定不再放进马匹时马才能进入另一个马厩并且每个马厩必须有至少一匹马。求最小的不和谐指数。
Time Limit:1000MS     Memory
 Limit:65536KB     64bit IO Form]]></description><category></category></item><item><title><![CDATA[URAL 1017]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10195119</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10195119</guid><author>u011629906</author><pubDate>Thu, 22 Aug 2013 19:11:06 +0800</pubDate><description><![CDATA[题目大意：求N的满足下列条件的划分的个数。划分中各个数互不相等。划分中至少有两个元素。
Time Limit:1000MS     Memory
 Limit:16384KB     64bit IO Format:%I64d
 & %I64u

数据规模：5
理论基础：正整数的划分：如果n=n1+n2+n3+...+nk（1=1)则称(n1,n2,...,nk)是正整数n的一个划分。]]></description><category></category></item><item><title><![CDATA[URAL 1073]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10174687</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10174687</guid><author>u011629906</author><pubDate>Thu, 22 Aug 2013 13:28:32 +0800</pubDate><description><![CDATA[（数论方法）参见：本博客URAL 1593。
题目大意：给出正整数n，求其最少可以表示为几个数的平方之和。
Time Limit:1000MS     Memory
 Limit:65536KB     64bit IO Format:%I64d
 & %I64u


数据规模：n

理论基础:无。

题目分析:先预处理出小于60000的平方数。存储在p[i]中，p[i]=i]]></description><category></category></item><item><title><![CDATA[URAL 1260]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10173151</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10173151</guid><author>u011629906</author><pubDate>Thu, 22 Aug 2013 10:59:50 +0800</pubDate><description><![CDATA[题目大意：给1-N个数排序，要求相邻的数的差不能大于2，求对应的排序方法（1必须在第一个）。
Time Limit:1000MS     Memory
 Limit:65536KB     64bit IO Format:%I64d
 & %I64u

数据规模：1
理论基础:无（好久没有学新理论了，因为这些题都不需要）。
题目分析：ans[i]表示N=i时的答案。那么ans[i]=]]></description><category></category></item><item><title><![CDATA[URAL 1353]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10172017</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10172017</guid><author>u011629906</author><pubDate>Thu, 22 Aug 2013 10:29:48 +0800</pubDate><description><![CDATA[题目大意：求1-10^9中各个位上的数的和为S的数的个数。
Time Limit:1000MS     Memory
 Limit:65536KB     64bit IO Format:%I64d
 & %I64u

数据规模：1
理论基础：无（dp题的关键在于状态与状态转移方程，理论什么的都貌似没多少）。
题目分析：用dp[i][j]表示n位数的各个位数和为j的个数。状态转移方程]]></description><category></category></item><item><title><![CDATA[URAL 1203]]></title><link>https://blog.youkuaiyun.com/u011629906/article/details/10155615</link><guid>https://blog.youkuaiyun.com/u011629906/article/details/10155615</guid><author>u011629906</author><pubDate>Thu, 22 Aug 2013 00:16:22 +0800</pubDate><description><![CDATA[题目大意：给出N个区间：[li,ri]（i=1,2,3,...,N）,求互不相交的最大区间的数目。
Time Limit:1000MS     Memory
 Limit:65536KB     64bit IO Format:%I64d
 & %I64u

数据规模：11
理论基础：]]></description><category></category></item></channel></rss>