LZRHINO-CSDN博客

原创简述JVM,DVM,ART

简述JVM,DVM,ARTJVMDVMJVM和DVM的区别ARTJVMJVM是Java Virtual Machine的缩写，JVM运行的操作系统之上，屏蔽了底层的实现差异，其本质是一个软件，是对计算机硬件层的软件抽象，使得Java程序编译后在JVM上面运行，实现“Write Once Run Anywhere”。与C语言编译后产生的汇编语言不同的是，Java编译后产生的是JVM字节码，然后J...

2020-04-22 16:33:55 461

原创 Franka 机械臂工控机环境的安装

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

2019-05-10 14:46:12 1795 3

原创 Linux 内核 PREEMPT_RT 补丁安装

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...

2019-05-08 22:51:20 2153 1

原创 POJ-2186 （强连通分量）

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 <= N <= 1...

2018-05-04 18:22:29 250

原创 POJ-3070 Fibonacci （矩阵快速幂）

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...

2018-04-25 13:39:23 239

原创 ACM矩阵相关模板；

矩阵快速幂：因为结构体已经重载了 * 所以只需在原来普通的快速幂模板的基础上稍微修改一下。其他操作主要是模拟。#define _rep(i, a, b) for(int i = a; i <= b; i++)#define _for(i, a, b) for(int i = a; i < b; i++)#define M_sel *thisusing namespace ...

2018-04-25 13:34:46 427

原创 POJ-2182 Lost Cows

Language:DefaultLost CowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12330 Accepted: 7925DescriptionN (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular ...

2018-03-27 14:20:15 158

原创 UVa227-Puzzle

题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=163#include <iostream>#include <cstdio>#include <cstring>#include ...

2018-03-19 17:40:35 169

原创优化整理

sort 排序优化#define _for(i,a,b) for(int i = (a); i < (b); i++)#define N 1000000struct Node{ int a,b,c;};struct cmp{ inline bool operator() (const Node& t1, const Node& t2){ if(t1.a !...

2018-03-10 23:14:42 200

原创 POJ - 3278 Catch That Cow (搜索)

Language:DefaultCatch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 102978 Accepted: 32162DescriptionFarmer John has been informed of

2018-01-20 10:34:18 180

原创 POJ-2251 Dungeon Master (搜索)

DescriptionYou 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

2018-01-20 09:33:01 176

原创（最短路）POJ - 2387 ：Til the Cows Come Home

Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 61545 Accepted: 20880DescriptionBessie is out in the field and wants to get back

2018-01-04 22:48:02 621

原创 ACM 模板整理

一 .图论:最短路：1. Dijkstra 算法：/*用优先队列优化，vector存储边，输入方式： while (~scanf("%d%d", &m, &n) && m) { for (int i = 0; i < m; i++) { scanf("%d%d%d", &a, &b, &c); G[a].push_b...

2018-01-04 22:38:54 321

原创 PAT乙级训练集-1

1025. 反转链表 (25)时间限制300 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者CHEN, Yue给定一个常数K以及一个单链表L，请编写程序将L中每K个结点反转。例如：给定L为1→2→3→4→5→6，K为3

2017-11-30 15:13:49 277

原创 HDU-1230 I NEED A OFFER! （完全背包）

Problem DescriptionSpeakless很早就想出国，现在他已经考完了所有需要的考试，准备了所有要准备的材料，于是，便需要去申请学校了。要申请国外的任何大学，你都要交纳一定的申请费用，这可是很惊人的。Speakless没有多少钱，总共只攒了n万美元。他将在m个学校中选择若干的（当然要在他的经济承受范围内）。每个学校都有不同的申请费用a（万美元），并且Speakless估计了

2017-07-27 07:28:56 248

原创 HDU-1203

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): 11613Problem DescriptionSpeakles

2017-07-07 00:37:32 354

原创 HDU-2602

Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 62187 Accepted Submission(s): 25918Problem DescriptionMany year

2017-07-07 00:36:22 347

原创 HDU-1421

搬寝室Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28404 Accepted Submission(s): 9750Problem Description搬寝室是很累的,xhd深有体会.时间追述2

2017-07-07 00:26:58 218

原创 HDU-1160

FatMouse's SpeedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16432 Accepted Submission(s): 7264Special JudgeProblem Descriptio

2017-07-07 00:19:30 254

原创 HDU-1231&HDU-1003

最大连续子序列Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32827Accepted Submission(s): 14770Problem Description给定K个整数的序列{ N1, N...

2017-07-07 00:12:08 269

原创 HDU-1159

Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there e

2017-07-07 00:10:10 261

原创 HDU-1176

Problem Description都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了，所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人，所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏，虽然在游戏中

2017-07-07 00:00:15 343

原创 HDU-1087

Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to

2017-07-06 23:43:26 231

原创 HDU-2084

Problem Description在讲述DP算法的时候，一个经典的例子就是数塔问题，它是这样描述的：有如下所示的数塔，要求从顶层走到底层，若每一步只能走到相邻的结点，则经过的结点的数字之和最大是多少？已经告诉你了，这是个DP的题目，你能AC吗? Input输入数据首先包括一个整数C,表示测试实例的个数，每个测试实例的第一行是一个整数N(1

2017-07-06 23:10:23 250

ZERHLINTOP