<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ZERHLINTOP]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Lin_ZR</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Lin_ZR]]></copyright><item><title><![CDATA[简述JVM,DVM,ART]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/105684414</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/105684414</guid><author>Lin_ZR</author><pubDate>Wed, 22 Apr 2020 16:33:55 +0800</pubDate><description><![CDATA[简述JVM,DVM,ARTJVMDVMJVM和DVM的区别ART
JVM
JVM是Java Virtual Machine的缩写，JVM运行的操作系统之上，屏蔽了底层的实现差异，其本质是一个软件，是对计算机硬件层的软件抽象，使得Java程序编译后在JVM上面运行，实现“Write Once Run Anywhere”。与C语言编译后产生的汇编语言不同的是，Java编译后产生的是JVM字节码，然后J...]]></description><category></category></item><item><title><![CDATA[Franka 机械臂工控机环境的安装]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/89979698</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/89979698</guid><author>Lin_ZR</author><pubDate>Fri, 10 May 2019 14:46:12 +0800</pubDate><description><![CDATA[Franka工控机环境的配置操作系统和ROS环境的安装设置实时内核
操作系统和ROS环境的安装




操作系统
ROS系统




Ubuntu16.04
Kinetic


讲义介绍了ROS的相关基础概念，第一章就是相关安装的介绍，写的很详细。
中国大学MOOC—《机器人操作系统入门》课程讲义.
设置实时内核
我的另一篇文章有介绍
Linux 内核 PREEMPT_RT 补丁安装

...]]></description><category></category></item><item><title><![CDATA[Linux 内核 PREEMPT_RT 补丁安装]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/89979083</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/89979083</guid><author>Lin_ZR</author><pubDate>Wed, 08 May 2019 22:51:20 +0800</pubDate><description><![CDATA[Linux 内核 PREEMPT_RT 补丁安装Ubuntu实时内核的安装选择Linux PREEMPT_RT 内核版本：安装实时内核：验证新内核
Ubuntu实时内核的安装
安装相关依赖项
sudo apt-get install build-essential bc curl ca-certificates fakeroot gnupg2 libssl-dev libncurses-dev l...]]></description><category></category></item><item><title><![CDATA[POJ-2186 （强连通分量）]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/80198854</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/80198854</guid><author>Lin_ZR</author><pubDate>Fri, 04 May 2018 18:22:29 +0800</pubDate><description><![CDATA[Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 37824 Accepted: 15398DescriptionEvery cow's dream is to become the most popular cow in the herd. In a herd of N (1 &amp;lt;= N &amp;lt;= 1...]]></description><category></category></item><item><title><![CDATA[POJ-3070 Fibonacci （矩阵快速幂）]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/80078016</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/80078016</guid><author>Lin_ZR</author><pubDate>Wed, 25 Apr 2018 13:39:23 +0800</pubDate><description><![CDATA[FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17928 Accepted: 12470DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, t...]]></description><category></category></item><item><title><![CDATA[ACM矩阵相关模板；]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/80077871</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/80077871</guid><author>Lin_ZR</author><pubDate>Wed, 25 Apr 2018 13:34:46 +0800</pubDate><description><![CDATA[矩阵快速幂： 因为结构体已经重载了 * 所以只需在原来普通的快速幂模板的基础上稍微修改一下。其他操作主要是模拟。#define  _rep(i, a, b) for(int i = a; i &amp;lt;= b; i++)
#define  _for(i, a, b) for(int i = a; i &amp;lt; b; i++)
#define  M_sel *this
using namespace ...]]></description><category></category></item><item><title><![CDATA[POJ-2182 Lost Cows]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/79712313</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/79712313</guid><author>Lin_ZR</author><pubDate>Tue, 27 Mar 2018 14:20:15 +0800</pubDate><description><![CDATA[Language:DefaultLost CowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12330 Accepted: 7925DescriptionN (2 &amp;lt;= N &amp;lt;= 8,000) cows have unique brands in the range 1..N. In a spectacular ...]]></description><category></category></item><item><title><![CDATA[UVa227-Puzzle]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/79614832</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/79614832</guid><author>Lin_ZR</author><pubDate>Mon, 19 Mar 2018 17:40:35 +0800</pubDate><description><![CDATA[题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&amp;amp;Itemid=8&amp;amp;page=show_problem&amp;amp;problem=163#include &amp;lt;iostream&amp;gt;
#include &amp;lt;cstdio&amp;gt;
#include &amp;lt;cstring&amp;gt;
#include ...]]></description><category></category></item><item><title><![CDATA[优化整理]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/79511601</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/79511601</guid><author>Lin_ZR</author><pubDate>Sat, 10 Mar 2018 23:14:42 +0800</pubDate><description><![CDATA[sort 排序优化#define _for(i,a,b) for(int i = (a); i &amp;lt; (b); i++)
#define N  1000000
struct Node{
	int a,b,c;
};
struct cmp{ 
	inline bool operator() (const Node&amp;amp; t1, const Node&amp;amp; t2){
		if(t1.a !...]]></description><category></category></item><item><title><![CDATA[POJ - 3278 Catch That Cow (搜索)]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/79112529</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/79112529</guid><author>Lin_ZR</author><pubDate>Sat, 20 Jan 2018 10:34:18 +0800</pubDate><description><![CDATA[Language:
Default

Catch That Cow




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 102978
 
Accepted: 32162





Description

Farmer John has been informed of ]]></description><category></category></item><item><title><![CDATA[POJ-2251 Dungeon Master  (搜索)]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/79112149</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/79112149</guid><author>Lin_ZR</author><pubDate>Sat, 20 Jan 2018 09:33:01 +0800</pubDate><description><![CDATA[Description

You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one un]]></description><category></category></item><item><title><![CDATA[（最短路）POJ - 2387 ：Til the Cows Come Home]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/78976356</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/78976356</guid><author>Lin_ZR</author><pubDate>Thu, 04 Jan 2018 22:48:02 +0800</pubDate><description><![CDATA[Til the Cows Come Home




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 61545
 
Accepted: 20880





Description

Bessie is out in the field and wants to get back]]></description><category></category></item><item><title><![CDATA[ACM 模板整理]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/78976281</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/78976281</guid><author>Lin_ZR</author><pubDate>Thu, 04 Jan 2018 22:38:54 +0800</pubDate><description><![CDATA[一 .图论:最短路：1. Dijkstra 算法：/*用优先队列优化，vector存储边，
输入方式：
	while (~scanf(&quot;%d%d&quot;, &amp;amp;m, &amp;amp;n) &amp;amp;&amp;amp; m) {
		for (int i = 0; i &amp;lt; m; i++) {
			scanf(&quot;%d%d%d&quot;, &amp;amp;a, &amp;amp;b, &amp;amp;c);
			G[a].push_b...]]></description><category></category></item><item><title><![CDATA[PAT乙级训练集-1]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/78676155</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/78676155</guid><author>Lin_ZR</author><pubDate>Thu, 30 Nov 2017 15:13:49 +0800</pubDate><description><![CDATA[1025. 反转链表 (25)



时间限制

300 ms




内存限制

65536 kB




代码长度限制

8000 B




判题程序

Standard


作者

CHEN, Yue




给定一个常数K以及一个单链表L，请编写程序将L中每K个结点反转。例如：给定L为1→2→3→4→5→6，K为3]]></description><category></category></item><item><title><![CDATA[HDU-1230 I NEED A OFFER! （完全背包）]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/76168269</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/76168269</guid><author>Lin_ZR</author><pubDate>Thu, 27 Jul 2017 07:28:56 +0800</pubDate><description><![CDATA[Problem Description

Speakless很早就想出国，现在他已经考完了所有需要的考试，准备了所有要准备的材料，于是，便需要去申请学校了。要申请国外的任何大学，你都要交纳一定的申请费用，这可是很惊人的。Speakless没有多少钱，总共只攒了n万美元。他将在m个学校中选择若干的（当然要在他的经济承受范围内）。每个学校都有不同的申请费用a（万美元），并且Speakless估计了]]></description><category></category></item><item><title><![CDATA[HDU-1203]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/74621743</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/74621743</guid><author>Lin_ZR</author><pubDate>Fri, 07 Jul 2017 00:37:32 +0800</pubDate><description><![CDATA[I NEED A OFFER!
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 28615    Accepted Submission(s): 11613



Problem Description

Speakles]]></description><category></category></item><item><title><![CDATA[HDU-2602]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/74621691</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/74621691</guid><author>Lin_ZR</author><pubDate>Fri, 07 Jul 2017 00:36:22 +0800</pubDate><description><![CDATA[Bone Collector
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 62187    Accepted Submission(s): 25918



Problem Description

Many year]]></description><category></category></item><item><title><![CDATA[HDU-1421]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/74621264</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/74621264</guid><author>Lin_ZR</author><pubDate>Fri, 07 Jul 2017 00:26:58 +0800</pubDate><description><![CDATA[搬寝室
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 28404    Accepted Submission(s): 9750



Problem Description

搬寝室是很累的,xhd深有体会.时间追述2]]></description><category></category></item><item><title><![CDATA[HDU-1160]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/74620911</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/74620911</guid><author>Lin_ZR</author><pubDate>Fri, 07 Jul 2017 00:19:30 +0800</pubDate><description><![CDATA[FatMouse's Speed
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 16432    Accepted Submission(s): 7264
Special Judge


Problem Descriptio]]></description><category></category></item><item><title><![CDATA[HDU-1231&HDU-1003]]></title><link>https://blog.youkuaiyun.com/Lin_ZR/article/details/74620554</link><guid>https://blog.youkuaiyun.com/Lin_ZR/article/details/74620554</guid><author>Lin_ZR</author><pubDate>Fri, 07 Jul 2017 00:12:08 +0800</pubDate><description><![CDATA[最大连续子序列



Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 32827Accepted Submission(s): 14770





Problem Description

给定K个整数的序列{ N1, N...]]></description><category></category></item></channel></rss>