<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[welcome to 浩·C's blog]]></title><description><![CDATA[Use it,and learn it! ]]></description><link>https://blog.youkuaiyun.com/Cui_csdn</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Cui_csdn]]></copyright><item><title><![CDATA[UVA 1428 - Ping pong(树状数组)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/77891880</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/77891880</guid><author>Cui_csdn</author><pubDate>Fri, 08 Sep 2017 10:35:13 +0800</pubDate><description><![CDATA[题目大意：

一条大街上住着n个乒乓球爱好者，经常比赛切磋技术。每个人都有一个不同的技能值a[i]；每场比赛需要3个人：两名选手，一名裁判。他们有个奇怪的约定，裁判必须住在两名选手之间，而裁判的能力值也必须在两名选手之间。问一共能组织多少种比赛。

分析：

假设a[1]到a[i-1]中小于a[i]的数有p[i]，a[i+1]到a[n]中小于a[i]的数有s[i]个;

这样当i为]]></description><category></category></item><item><title><![CDATA[hdu problem1166 (树状数组)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/77891848</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/77891848</guid><author>Cui_csdn</author><pubDate>Fri, 08 Sep 2017 10:32:03 +0800</pubDate><description><![CDATA[敌兵布阵
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 99247    Accepted Submission(s): 42037



Problem Description

C国的死对头A国这段时间正在进行军事演]]></description><category></category></item><item><title><![CDATA[二叉树的遍历(递归)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/77849730</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/77849730</guid><author>Cui_csdn</author><pubDate>Tue, 05 Sep 2017 11:53:32 +0800</pubDate><description><![CDATA[1058: 二叉树遍历
时间限制: 1 Sec  内存限制: 128 MB
提交: 18  解决: 8
[提交][状态][讨论版]
题目描述

对于二叉树T，可以有先序遍历、中序遍历和后序遍历三种遍历方式。现在我们要求给出一棵二叉树的先序遍历序列和中序遍历序列，输出它的广度优先遍历序列。 

输入

第一行为一个整数t（0

输出

为每个测试用例单独一行输出广度优先遍]]></description><category></category></item><item><title><![CDATA[硬币问题(经典dp)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/77781122</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/77781122</guid><author>Cui_csdn</author><pubDate>Fri, 01 Sep 2017 23:04:02 +0800</pubDate><description><![CDATA[Coin Change





You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. I]]></description><category></category></item><item><title><![CDATA[矩形嵌套(经典dp)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/77777537</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/77777537</guid><author>Cui_csdn</author><pubDate>Fri, 01 Sep 2017 20:59:49 +0800</pubDate><description><![CDATA[矩形嵌套
时间限制：3000 ms  |  内存限制：65535 KB
难度：4





描述有n个矩形，每个矩形可以用a,b来描述，表示长和宽。矩形X(a,b)可以嵌套在矩形Y(c,d)中当且仅当a<c,b<d或者b<c,a<d（相当于旋转X90度）。例如（1,5）可以嵌套在（6,2）内，但不能嵌套在（3,4）中。你的任务是选出尽可能多的矩形排成一行，使得除最后一个外，每一个矩]]></description><category></category></item><item><title><![CDATA[ACM算法-时间复杂度分析(6.相关练习exercise)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/77674932</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/77674932</guid><author>Cui_csdn</author><pubDate>Tue, 29 Aug 2017 11:02:53 +0800</pubDate><description><![CDATA[练习1：Analysis of Algorithms




练习2：Master Theorem





MIT’s Video lecture 1 on Introduction to Algorithms.]]></description><category></category></item><item><title><![CDATA[ACM算法-时间复杂度分析(5.有关时间复杂度递归的分析)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/77674827</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/77674827</guid><author>Cui_csdn</author><pubDate>Tue, 29 Aug 2017 11:00:01 +0800</pubDate><description><![CDATA[Analysis of Algorithm | Set 4 (Solving Recurrences)


In the previous post, we discussed analysis
 of loops. Many algorithms are recursive in nature. When we analyze them, we get a recurrence rela]]></description><category></category></item><item><title><![CDATA[ACM算法-时间复杂度分析(4.有关时间复杂度循环的分析)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/77674625</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/77674625</guid><author>Cui_csdn</author><pubDate>Tue, 29 Aug 2017 10:56:57 +0800</pubDate><description><![CDATA[Analysis of Algorithms | Set 4 (Analysis of Loops)


We have discussed Asymptotic Analysis,  Worst,
 Average and Best Cases  and Asymptotic
 Notations in previous posts. In this post, analysis of]]></description><category></category></item><item><title><![CDATA[ACM算法-时间复杂度分析(3.渐进符号)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/77674341</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/77674341</guid><author>Cui_csdn</author><pubDate>Tue, 29 Aug 2017 10:54:06 +0800</pubDate><description><![CDATA[Analysis of Algorithms | Set 3 (Asymptotic Notations)


We have discussed Asymptotic Analysis,
 and Worst, Average and Best Cases of Algorithms.
 The main idea of asymptotic analysis is to have a]]></description><category></category></item><item><title><![CDATA[ACM算法-时间复杂度分析(2.最坏，平均，最好时间复杂度分析)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/77673999</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/77673999</guid><author>Cui_csdn</author><pubDate>Tue, 29 Aug 2017 10:52:21 +0800</pubDate><description><![CDATA[Analysis of Algorithms | Set 2 (Worst, Average and Best Cases)


In the previous post, we discussed how Asymptotic analysis overcomes the problems
 of naive way of analyzing algorithms. In this po]]></description><category></category></item><item><title><![CDATA[ACM算法-时间复杂度分析(1.渐进分析)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/77672907</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/77672907</guid><author>Cui_csdn</author><pubDate>Tue, 29 Aug 2017 10:48:56 +0800</pubDate><description><![CDATA[写在前面：我看了这几篇文章，对时间复杂度理解更加深刻了。分享给大家。




Analysis of Algorithms | Set 1 (Asymptotic Analysis)



Why performance analysis?
There are many important things that should be taken care of, like us]]></description><category></category></item><item><title><![CDATA[网易2018校招内推编程题]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/77145639</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/77145639</guid><author>Cui_csdn</author><pubDate>Sun, 13 Aug 2017 16:06:32 +0800</pubDate><description><![CDATA[题目链接地址：https://www.nowcoder.com/test/6291726/summary


1.彩色的砖块
#include 
#include 
using namespace std;

set chs;
int main()
{
	char ch;
	while(cin>>ch)
		chs.insert(ch);
	int n=chs.size();
	int a]]></description><category></category></item><item><title><![CDATA[UVa Spreading the Wealth-11300(数学推导+中位数)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/73824473</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/73824473</guid><author>Cui_csdn</author><pubDate>Tue, 27 Jun 2017 22:37:41 +0800</pubDate><description><![CDATA[Spreading the Wealth

Problem

A Communist regime is trying to redistribute wealth in a village. They have have decided to sit everyone around a circular table. First, everyone has converted all o]]></description><category></category></item><item><title><![CDATA[UVa Commando War-11729(排序+贪心)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/73756478</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/73756478</guid><author>Cui_csdn</author><pubDate>Mon, 26 Jun 2017 23:52:38 +0800</pubDate><description><![CDATA[There is a war and it doesn't look very promising for your country. Now it's time to act. You have a commando squad at your disposal and planning an ambush on an important enemy camp located nearby. Y]]></description><category></category></item><item><title><![CDATA[UVaThe Dragon of Loowater-11292(排序+贪心)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/73744571</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/73744571</guid><author>Cui_csdn</author><pubDate>Mon, 26 Jun 2017 21:33:27 +0800</pubDate><description><![CDATA[Once upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem. 
The shores of Rellau Creek in central Loowater had always been a prime breeding ground for geese. Due to t]]></description><category></category></item><item><title><![CDATA[UVa10976-Fractions Again?!(枚举)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/73702728</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/73702728</guid><author>Cui_csdn</author><pubDate>Sun, 25 Jun 2017 11:43:42 +0800</pubDate><description><![CDATA[//思路：枚举y:[k+1,2k]
#include
#include
using namespace std;

int main() {
  int k;
  while(scanf("%d", &k) == 1 && k) {
    vector X, Y;
    for(int y = k+1; y <= k*2; y++) {
      // 1/k = 1/x + 1/y =>]]></description><category></category></item><item><title><![CDATA[UVa 11059(枚举)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/73699763</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/73699763</guid><author>Cui_csdn</author><pubDate>Sun, 25 Jun 2017 11:01:22 +0800</pubDate><description><![CDATA[Given a sequence of integers S = {S1, S2, . . . , Sn}, you should determine what is the value of the
maximum positive product involving consecutive terms of S. If you cannot find a positive sequence,]]></description><category></category></item><item><title><![CDATA[hdu Problem-1426数独问题(dfs+回溯+枚举)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/73692081</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/73692081</guid><author>Cui_csdn</author><pubDate>Sat, 24 Jun 2017 15:18:04 +0800</pubDate><description><![CDATA[Sudoku Killer
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8089    Accepted Submission(s): 2497



Problem Description

自从2006年3月10日]]></description><category></category></item><item><title><![CDATA[UVa 725(简单枚举)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/73650217</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/73650217</guid><author>Cui_csdn</author><pubDate>Fri, 23 Jun 2017 17:20:09 +0800</pubDate><description><![CDATA[Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0 through 9 once each, such that the first number divided by the second is equal to an integer N,]]></description><category></category></item><item><title><![CDATA[UVa 1592Database(map的妙用)]]></title><link>https://blog.youkuaiyun.com/Cui_csdn/article/details/73549529</link><guid>https://blog.youkuaiyun.com/Cui_csdn/article/details/73549529</guid><author>Cui_csdn</author><pubDate>Wed, 21 Jun 2017 15:25:01 +0800</pubDate><description><![CDATA[Peter studies the theory of relational databases. Table in the relational database consists of values that are arranged in rows and columns. 
There are different normal forms that database may adhere]]></description><category></category></item></channel></rss>