<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qianmo_shine的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qianmo_shine</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qianmo_shine]]></copyright><item><title><![CDATA[hdu Travel]]></title><link>https://blog.youkuaiyun.com/qianmo_shine/article/details/48418909</link><guid>https://blog.youkuaiyun.com/qianmo_shine/article/details/48418909</guid><author>qianmo_shine</author><pubDate>Sun, 13 Sep 2015 19:56:35 +0800</pubDate><description><![CDATA[Travel
Time Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 46    Accepted Submission(s): 20



Problem Description

Jack likes to travel ]]></description><category></category></item><item><title><![CDATA[CF Modulo Sum]]></title><link>https://blog.youkuaiyun.com/qianmo_shine/article/details/48418007</link><guid>https://blog.youkuaiyun.com/qianmo_shine/article/details/48418007</guid><author>qianmo_shine</author><pubDate>Sun, 13 Sep 2015 19:04:35 +0800</pubDate><description><![CDATA[Modulo Sum


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



You are given a sequence of numbers a1, a2, ...,]]></description><category></category></item><item><title><![CDATA[codevs 没有上司的舞会]]></title><link>https://blog.youkuaiyun.com/qianmo_shine/article/details/48293471</link><guid>https://blog.youkuaiyun.com/qianmo_shine/article/details/48293471</guid><author>qianmo_shine</author><pubDate>Tue, 08 Sep 2015 16:58:33 +0800</pubDate><description><![CDATA[应该算的上是最简单的树状dp了，思路很简单，但是还是敲了二十分钟，为自己的手速感到汗颜。

#include 
#include 
#include 
using namespace std;
vectortree[6005];
int num[6005][2],top,n;//定义状态num[i][j]，i=0时表示j节点的父节点没有被选中，i=1时表示j节点的父节点被选中了
i]]></description><category></category></item></channel></rss>