<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[刘威的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/lweiyun</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lweiyun]]></copyright><item><title><![CDATA[杭电oj 1001 A + B Problem]]></title><link>https://blog.youkuaiyun.com/lweiyun/article/details/96305234</link><guid>https://blog.youkuaiyun.com/lweiyun/article/details/96305234</guid><author>lweiyun</author><pubDate>Wed, 17 Jul 2019 14:36:31 +0800</pubDate><description><![CDATA[Problem Description

Calculate A + B.

Input

Each line will contain two integers A and B. Process to end of file.

Output

For each case, output A + B in one line.

Sample Input

1 1

Sample Output

...]]></description><category></category></item><item><title><![CDATA[杭电oj 1003 Max Sum(动态规划)]]></title><link>https://blog.youkuaiyun.com/lweiyun/article/details/96295058</link><guid>https://blog.youkuaiyun.com/lweiyun/article/details/96295058</guid><author>lweiyun</author><pubDate>Wed, 17 Jul 2019 14:12:45 +0800</pubDate><description><![CDATA[动态规划求最大连续子序列和Problem DescriptionInputOutputSample InputSample Output题目大意解题思路代码说明
题目链接： Max Sum
Problem Description

Given a sequence a[1],a[2],a[3]…a[n], your job is to calculate the max sum of a sub-...]]></description><category></category></item></channel></rss>