Mr_Lsz-CSDN博客

原创 Unity物理引擎：布料简介

4.x的unity 布料分为交互布料，蒙皮布料，和布料的渲染器三个东东，现在整合到了一起。Colth参数：Stretching Stiffness---拉扯硬度.:数值在0-1之间，数值越大，越不容易拉伸。Bending Stiffness---弯曲硬度.：数值在0-1直接，数值越大，越不容易拉伸。Use Tethers---默认开启, 用于方式过度拉伸。Use Gra

2015-09-14 22:47:20 3868

原创 Unity物理引擎：Charactor Controller简介

角色控制器主要用于对第三人称或者第一人称游戏主角的控制，并不使用刚体物理效果。Slope Limit：坡度限制；该角色所能爬上的最大值的斜坡；Step Width ：台阶高度，该项用于设置角色对象可以迈上的最高台阶的高度。Skin Width：皮肤厚度。该参数决定了碰撞体可以互相深入的深度。较大的参数值会产生抖动的现象。较小的参数值会导致被卡住，较为合理的设定量

2015-09-14 20:10:53 1249

原创 Unity物理引擎：Colliders简介

碰撞体与刚体添加到游戏对象上才触发碰撞。1.Box Collider：盒碰撞体{ 是一个立方体外形的基本碰撞体；Is Trigger ：触发器；勾选该项，则该碰撞体课用于触发事件，并将被物理引擎所忽略。Material：材质：采用不同的物理材质类型决定了碰撞体与其他对象的交互方式，{Center：中心，碰撞体在对象局部坐标中的位置，Size ：大小;碰撞体在XYZ方

2015-09-14 19:41:28 1601

原创 Unity物理引擎：Rigidbody简介

面板参数：Mass ：质量：设置物体的质量。Drag：阻力：当对象运动时收到的空气阻力。阻力极大时会导致游戏物体无法运动；Angular Drag ：角阻力：当对象受扭矩力旋转时收到的空气阻力。阻力极大时会导致游戏物体停止运动。Use Gravity：使用重力：若开启此项，游戏对象将会收到重力的影响。Is Kinematic：是否开启动力学：若开启此项，游戏对象将不再受到物理

2015-09-14 16:48:40 1553

原创 Nav Mesh Agent 参数说明

导航网格代理（仅专业版） NavMesh Agent (Pro Only)Date:2013-08-06 13:17The NavMesh Agent component is used in connection with pathfinding, and is the place to put information about how this agent nav

2015-09-07 19:13:01 5724

转载 SWUST OJ数据结构输出格式

数据结构之线性结构： 0941 ：不换行,最后一个数后面有空格 0942 ：同上 0943 ：同上 0952：同上，注意：error!后面没有空格. 0953：同上 0954：不换行,最后一个元素后面有空格 0

2015-09-07 17:08:28 1864

原创 HDU 1157 Who's in the Middle

Problem DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more than the median; half give a

2015-03-21 23:01:59 478

原创 HDU 1098 Ignatius's puzzle

Problem DescriptionIgnatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that ,input a nonegative integer k(kno exists that

2015-03-21 22:53:23 588

原创 HDU 1070 Milk

Problem DescriptionIgnatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermarket, so Ignatius wants to know w

2015-03-21 21:01:29 454

原创 HDU 1058 Humble Numbers

Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the fir

2015-03-21 20:36:17 399

原创 HDU 1097 A hard puzzle

Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem easier than begin.

2015-03-21 20:12:10 559

原创 HDU 1096 A+B for Input-Output Practice (VIII)

Problem DescriptionYour task is to calculate the sum of some integers. InputInput contains an integer N in the first line, and then N lines follow. Each line starts with a integer

2015-03-21 20:09:18 442

原创 HDU 2084 数塔

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

2015-03-17 15:22:28 509

原创 HDU 1978 How many ways

Problem Description这是一个简单的生存游戏，你控制一个机器人从一个棋盘的起始点(1,1)走到棋盘的终点(n,m)。游戏的规则描述如下：1.机器人一开始在棋盘的起始点并有起始点所标有的能量。2.机器人只能向右或者向下走，并且每走一步消耗一单位能量。3.机器人不能在原地停留。4.当机器人选择了一条可行路径后，当他走到这条路径的终点时，他将只有终点所标记的能量。

2015-03-17 15:07:05 474

原创 HDU 1501 Zipper

Problem DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitra

2015-03-17 14:29:48 567

原创 POJ 1579

DescriptionWe all love recursion! Don't we? Consider a three-parameter recursive function w(a, b, c): if a 1 if a > 20 or b > 20 or c > 20, then w(a, b, c) returns: w(20, 20, 20)

2015-03-17 14:22:48 568

原创 POJ 1088 滑雪

DescriptionMichael喜欢滑雪百这并不奇怪，因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 5 16 17 18 19 6 15 24 25 20 7 14

2015-03-16 22:50:27 426

转载 HDU 1003 1231 (六种姿势拿下连续子序列最大和问题)

六种姿势拿下连续子序列最大和问题，附伪代码（以HDU 1003 1231为例）问题描述：连续子序列最大和，其实就是求一个序列中连续的子序列中元素和最大的那个。比如例如给定序列： { -2, 11, -4, 13, -5, -2 } 其最大连续子序列为{ 11, -4, 13 }

2015-03-15 20:34:12 1528 2

原创 HDU 1242 Rescue

Problem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Their task is: approach Angel.

2015-03-15 20:10:02 450

原创 HDU 1241 Oil Deposits

Problem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates

2015-03-15 19:50:38 452

原创 HDU 1026 Ignatius and the Princess I

Problem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into feng5166's castle. The castle is a large labyrint

2015-03-15 16:55:49 456

原创 HDU 1072 Nightmare

Problem DescriptionIgnatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb

2015-03-15 16:38:10 479

原创 HDU 1016 Prime Ring Problem

Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime

2015-03-15 14:05:09 473

原创 HDU 1015 Safecracker

Problem Description=== Op tech briefing, 2002/11/02 06:42 CST === "The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them,

2015-03-15 13:54:18 870 1

原创 HDU 1010 Tempter of the Bone

Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He

2015-03-15 13:29:35 462

原创 HDU 1056 HangOver

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10280 Accepted Submission(s): 4359Problem DescriptionHow far can you make a sta

2015-03-12 21:40:02 495

原创 HDU 1048 The Hardest Problem Ever

Problem DescriptionJulius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In order for him to survive, he decided to create one of

2015-03-12 21:33:19 436

原创 HDU 1040 As Easy As A+B

As Easy As A+BTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42450 Accepted Submission(s): 18162Problem DescriptionThese day

2015-03-12 21:30:38 595

原创 HDU 1037 Keep on Truckin'

Problem DescriptionBoudreaux and Thibodeaux are on the road again . . ."Boudreaux, we have to get this shipment of mudbugs to Baton Rouge by tonight!""Don't worry, Thibodeaux, I already ch

2015-03-12 21:28:39 694

原创 HDU 1032 The 3n + 1 problem

Problem DescriptionProblems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property

2015-03-10 17:30:07 436

原创 HDU 1029 Ignatius and the Princess IV

Problem Description"OK, you are not too bad, em... But you can never pass the next test." feng5166 says."I will tell you an odd number N, and then N integers. There will be a special integer a

2015-03-10 17:14:35 463

原创 HDU 1028 Ignatius and the Princess III

Problem Description"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says."The second problem is, given an positive integer N, we define a

2015-03-10 17:08:36 505

原创 HDU 1021 Fibonacci Again

Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). InputInput consists of a sequence of lines, each containing an i

2015-03-10 16:59:28 514

原创 HDU 1019 Least Common Multiple

Problem DescriptionThe least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and

2015-03-10 16:50:03 416

原创 HDU 1017 A Mathematical Curiosity

Problem DescriptionGiven two integers n and m, count the number of pairs of integers (a,b) such that 0 This problem contains multiple test cases!The first line of a multiple input is an in

2015-03-10 16:36:06 682

原创 HDU 1013 Digital Roots

Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the result

2015-03-10 16:02:41 415

原创 HDU 1012 u Calculate e

Problem DescriptionA simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n.

2015-03-09 22:46:51 436

Problem DescriptionThe 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, in specified or

2015-03-09 22:41:15 879

原创 HDU1005 Number Sequence

Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n).

2015-03-09 22:33:08 506

原创 HDU 1003 Max Sum

Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5

2014-12-26 16:52:16 842