<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[aboc43983的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/aboc43983</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; aboc43983]]></copyright><item><title><![CDATA[201803-1 跳一跳]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708944</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708944</guid><author>aboc43983</author><pubDate>Thu, 07 Mar 2019 08:25:00 +0800</pubDate><description><![CDATA[试题编号： 201803-1试题名称：	跳一跳时间限制：	1.0s内存限制：	256.0MB问题描述：	问题描述
　　近来，跳一跳这款小游戏风靡全国，受到不少玩家的喜爱。　　简化后的跳一跳规则如下：玩家每次从当前方块跳到下一个方块，如果没有跳到下一个方块上则游戏结束。　　如果跳到了方块上，但没有跳到方块的中心则获得1分；跳到方块中心时，若上一次的得分为1分或这是本局游戏的第一次跳跃则此...]]></description><category></category></item><item><title><![CDATA[测试]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708945</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708945</guid><author>aboc43983</author><pubDate>Fri, 11 Jan 2019 10:43:00 +0800</pubDate><description><![CDATA[aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...]]></description><category></category></item><item><title><![CDATA[Wireshark    学习]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708942</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708942</guid><author>aboc43983</author><pubDate>Fri, 07 Dec 2018 13:26:00 +0800</pubDate><description><![CDATA[Wireshark 参考
https://zh.wikipedia.org/wiki/Wireshark

上面链接的下面的内容。
用户手册：http://man.lupaworld.com/content/network/wireshark/


https://blog.youkuaiyun.com/qicheng777/article/details/74452136
...]]></description><category></category></item><item><title><![CDATA[件开发项目中,过程管理文档包含哪些]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708943</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708943</guid><author>aboc43983</author><pubDate>Tue, 04 Dec 2018 12:35:00 +0800</pubDate><description><![CDATA[转：http://ask.zol.com.cn/x/5335760.html

在软件项目开发过程中，应该按软件开发要求撰写十三类文档，文档编制要求具有针对性、精确性、清晰性、完整性、灵活性、可追溯性！　　需求阶段　　1、可行性分析报告　　说明该软件开发项目的实现在技术上、经济上和社会因素上的可行性，评述为了合理地达到开发目标可供选择的各种可能实施方案，说明并论证所选定实施方案的理...]]></description><category></category></item><item><title><![CDATA[1012 The Best Rank (25)（25 分）]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708940</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708940</guid><author>aboc43983</author><pubDate>Wed, 22 Aug 2018 13:24:00 +0800</pubDate><description><![CDATA[1012The Best Rank (25)（25分）



To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics...]]></description><category></category></item><item><title><![CDATA[1011 World Cup Betting (20)（20 分）]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708938</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708938</guid><author>aboc43983</author><pubDate>Wed, 22 Aug 2018 01:09:00 +0800</pubDate><description><![CDATA[ball Lottery provided a "Triple Winning" game. The rule of winning was simple: first select any three of the games. Then for each selected game, bet on one of the three possible results -- namely...]]></description><category></category></item><item><title><![CDATA[1009 Product of Polynomials (25)（25 分）]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708941</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708941</guid><author>aboc43983</author><pubDate>Wed, 22 Aug 2018 00:22:00 +0800</pubDate><description><![CDATA[1009Product of Polynomials (25)（25分）



This time, you are supposed to find A*B where A and B are two polynomials.
Input Specification:
Each input file contains one test case. Each case o...]]></description><category></category></item><item><title><![CDATA[1008 Elevator (20)（20 分）]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708936</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708936</guid><author>aboc43983</author><pubDate>Tue, 21 Aug 2018 00:52:00 +0800</pubDate><description><![CDATA[1008 Elevator (20)（20 分）


The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop,...]]></description><category></category></item><item><title><![CDATA[1007 Maximum Subsequence Sum (25)（25 分）]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708722</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708722</guid><author>aboc43983</author><pubDate>Tue, 21 Aug 2018 00:23:00 +0800</pubDate><description><![CDATA[1007 Maximum Subsequence Sum (25)（25 分）


Given a sequence of K integers { N~1~, N~2~, ..., N~K~ }. A continuous subsequence is defined to be { N~i~, N~i+1~, ..., N~j~ } where 1 &lt;= i &lt;= ...]]></description><category></category></item><item><title><![CDATA[1006 Sign In and Sign Out (25)（25 分）]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708723</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708723</guid><author>aboc43983</author><pubDate>Mon, 20 Aug 2018 23:51:00 +0800</pubDate><description><![CDATA[1006 Sign In and Sign Out (25)（25 分）


At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. G...]]></description><category></category></item><item><title><![CDATA[1005 Spell It Right (20)（20 分）]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708939</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708939</guid><author>aboc43983</author><pubDate>Thu, 09 Aug 2018 22:00:00 +0800</pubDate><description><![CDATA[1005 Spell It Right (20)（20 分）


Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.
Input Specification:
Ea...]]></description><category></category></item><item><title><![CDATA[1004 Counting Leaves (30)（30 分）]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708934</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708934</guid><author>aboc43983</author><pubDate>Thu, 09 Aug 2018 21:21:00 +0800</pubDate><description><![CDATA[1004 Counting Leaves (30)（30 分）


A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.
Input
Each input file contains one ...]]></description><category></category></item><item><title><![CDATA[PAT 1003 Emergency (25)（25 分）]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708937</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708937</guid><author>aboc43983</author><pubDate>Thu, 09 Aug 2018 19:44:00 +0800</pubDate><description><![CDATA[1003 Emergency (25)（25 分）


As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of...]]></description><category></category></item><item><title><![CDATA[51nod1019逆序数(归并排序/树状数组)]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708932</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708932</guid><author>aboc43983</author><pubDate>Tue, 07 Aug 2018 20:51:00 +0800</pubDate><description><![CDATA[51nod1019逆序数(归并排序/树状数组)
题目链接：http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1019
转：https://www.cnblogs.com/geloutingyu/p/6181096.html
题意：中文题诶～

思路：
方法1：归并排序～
归并排序过程为，先不断二分...]]></description><category></category></item><item><title><![CDATA[51nod_1212_无向图最小生成树(模板题)]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708935</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708935</guid><author>aboc43983</author><pubDate>Sun, 05 Aug 2018 14:51:00 +0800</pubDate><description><![CDATA[1212 无向图最小生成树 
基准时间限制：1 秒 空间限制：131072 KB 分值: 0 难度：基础题




N个点M条边的无向连通图，每条边有一个权值，求该图的最小生成树。





Input
第1行：2个数N,M中间用空格分隔，N为点的数量，M为边的数量。（2&lt;=N&lt;=1000,1&lt;=M&lt;=50000)...]]></description><category></category></item><item><title><![CDATA[1384 全排列（回溯）]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708930</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708930</guid><author>aboc43983</author><pubDate>Fri, 03 Aug 2018 01:12:00 +0800</pubDate><description><![CDATA[1384 全排列 
基准时间限制：1 秒 空间限制：131072 KB 分值: 0 难度：基础题

 收藏
 关注



给出一个字符串S（可能有重复的字符），按照字典序从小到大，输出S包括的字符组成的所有排列。例如：S = "1312"，
输出为：

1123
1132
1213
1231
1312
1321
2113
2131
2311
31...]]></description><category></category></item><item><title><![CDATA[2006 飞行员配对(二分图最大匹配)]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708933</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708933</guid><author>aboc43983</author><pubDate>Thu, 02 Aug 2018 18:14:00 +0800</pubDate><description><![CDATA[2006 飞行员配对(二分图最大匹配) 
题目来源： 网络流24题
基准时间限制：1 秒 空间限制：131072 KB 分值: 0 难度：基础题

 收藏
 关注




第二次世界大战时期，英国皇家空军从沦陷国征募了大量外籍飞行员。由皇家空军派出的每一架飞机都需要配备在航行技能和语言上能互相配合的2名飞行员，其中1名是英国飞行员，另1名是外籍飞行员。在众多的飞行员中...]]></description><category></category></item><item><title><![CDATA[HDU 2063 过山车（二分匹配模板）]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708928</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708928</guid><author>aboc43983</author><pubDate>Thu, 02 Aug 2018 14:52:00 +0800</pubDate><description><![CDATA[过山车
Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29163Accepted Submission(s): 12569
Problem Description
RPG
 
girls今天和大家一起去游乐场玩...]]></description><category></category></item><item><title><![CDATA[minval_优先队列排序]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708931</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708931</guid><author>aboc43983</author><pubDate>Tue, 31 Jul 2018 00:18:00 +0800</pubDate><description><![CDATA[2269:
时间限制: 3 Sec内存限制: 256 MB提交: 839解决: 151[提交][状态][讨论版][命题人:外部导入]
题目描述

	有两个长度为N的序列A和B，在A和B中各任取一个数相加可以得到N2个和，求这N2个和中最小的N个。 



输入

	第一行输入一个正整数N（1&lt;=N&lt;=100000）； 
	第二行N个...]]></description><category></category></item><item><title><![CDATA[51nod 1079 中国剩余定理(模板题)]]></title><link>https://blog.youkuaiyun.com/aboc43983/article/details/101708926</link><guid>https://blog.youkuaiyun.com/aboc43983/article/details/101708926</guid><author>aboc43983</author><pubDate>Sat, 14 Jul 2018 23:50:00 +0800</pubDate><description><![CDATA[1079 中国剩余定理 
基准时间限制：1 秒 空间限制：131072 KB 分值: 0 难度：基础题

 收藏
 关注


一个正整数K，给出K Mod 一些质数的结果，求符合条件的最小的K。例如，K % 2 = 1, K % 3 = 2, K % 5 = 3。符合条件的最小的K = 23。



Input
第1行：1个数N表示后面输入的质数及模的数量。（2...]]></description><category></category></item></channel></rss>