随笔
森林海的棕熊
极客文化
展开
-
UML 类关系图笔记
原创 2020-08-29 18:54:25 · 159 阅读 · 0 评论 -
动态规划O - How to Type HDU - 2577
Pirates have finished developing the typing software. He called Cathy to test his typing software. She is good at thinking. After testing for several days, she finds that if she types a string by some原创 2017-10-31 21:15:16 · 191 阅读 · 0 评论 -
动态规划C - Max Sum HDU - 1003
Given 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 + 4 = 14. Input The f原创 2017-10-23 20:29:30 · 259 阅读 · 0 评论 -
动态规划A - Robberies HDU - 2955
The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work in the lucrative原创 2017-10-23 19:43:34 · 237 阅读 · 0 评论 -
codeforce 347c
It is so boring in the summer holiday, isn’t it? So Alice and Bob have invented a new game to play. The rules are as follows. First, they get a set of n distinct integers. And then they take turns to m原创 2017-10-22 19:02:42 · 278 阅读 · 0 评论 -
CodeForces347B
You want to arrange n integers a1, a2, …, an in some order in a row. Let’s define the value of an arrangement as the sum of differences between all pairs of adjacent integers.More formally, let’s denot原创 2017-10-22 17:56:15 · 243 阅读 · 0 评论 -
CodeForces347A
You want to arrange n integers a1, a2, …, an in some order in a row. Let’s define the value of an arrangement as the sum of differences between all pairs of adjacent integers.More formally, let’s denot原创 2017-10-22 17:13:09 · 269 阅读 · 0 评论 -
CodeForces334B
Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.However, all Mike has is lots of identical resistors with unit r原创 2017-10-22 16:47:06 · 409 阅读 · 0 评论 -
CodeForces344B
Mad scientist Mike is busy carrying out experiments in chemistry. Today he will attempt to join three atoms into one molecule.A molecule consists of atoms, with some pairs of atoms connected by atomic原创 2017-10-22 12:23:38 · 242 阅读 · 0 评论 -
动态规划F - Bone Collector HDU - 2602
01背包问题 Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …原创 2017-10-24 10:55:43 · 249 阅读 · 0 评论 -
动态规划 G - Super Jumping! Jumping! Jumping! HDU - 1087
Nowadays, 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 you now.The game can be原创 2017-10-24 14:30:54 · 161 阅读 · 0 评论 -
命令行开wifi
配置热点netsh wlan set hostednetwork mode=allow ssid=inpc key=12345678 ssid wifi名 key 密码(八位数)开启热点netsh wlan start hostednetwork显示连接信息netsh wlan show hostednetwork关闭热点netsh wlan stop hosted...原创 2018-07-19 15:23:43 · 1128 阅读 · 0 评论 -
A - 01 CodeForces - 349A
The new “Die Hard” movie has just been released! There are n people at the cinema box office standing in a huge line. Each of them has a single 100, 50 or 25 ruble bill. A “Die Hard” ticket costs 25 ru原创 2017-11-04 11:16:43 · 220 阅读 · 0 评论 -
动态规划Q - Beans HDU - 2845
注 若Java 遇到 EOF 终止 只能用 hasNextLine()来判断 Bean-eating is an interesting game, everyone owns an M*N matrix, which is filled with different qualities beans. Meantime, there is only one bean in any 1*1 gr原创 2017-11-03 09:32:49 · 238 阅读 · 0 评论 -
B - Radar Installation POJ - 1328
Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on the c原创 2017-11-12 14:05:26 · 244 阅读 · 0 评论 -
Java动态规划模板 P - Coins HDU - 2844
解这道题的时候涉及了多重背包和完全背包,就写了一个Java动态规划模板Whuacmers use coins.They have coins of value A1,A2,A3…An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice原创 2017-11-02 15:26:00 · 247 阅读 · 0 评论 -
完美世界校招算法题2017
7点开始笔试,迟到了半小时,幸好还是全做完了。一道比较,一道动态规划,都挺有趣的,凭记忆描述题目,代码半小时写出来的,未优化,用的Java题目一首先输入一个整数n 有A、B两个队伍,每个队伍有n个人,每个人都有一个整数型武力值, A队,B队每个人相互比武,武力值大,队伍+100,相等不加分,武力值小-100。每个人只出场一次。输出A队最高得分输入样例6 2 3 4 5 6 7 3 4 5原创 2017-11-02 07:50:28 · 969 阅读 · 0 评论 -
A - Cleaning Shifts POJ - 2376
Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow working on cleaning things up and has divided the day into T s原创 2017-11-10 12:01:32 · 247 阅读 · 0 评论 -
动态规划H - 命运 HDU - 2571
穿过幽谷意味着离大魔王lemon已经无限接近了! 可谁能想到,yifenfei在斩杀了一些虾兵蟹将后,却再次面临命运大迷宫的考验,这是魔王lemon设下的又一个机关。要知道,不论何人,若在迷宫中被困1小时以上,则必死无疑! 可怜的yifenfei为了去救MM,义无返顾地跳进了迷宫。让我们一起帮帮执着的他吧! 命运大迷宫可以看成是一个两维的方格阵列,如下图所示:yifen原创 2017-10-24 15:19:40 · 260 阅读 · 0 评论 -
CodeForce334A
Mad scientist Mike entertains himself by arranging rows of dominoes. He doesn’t need dominoes, though: he uses rectangular magnets instead. Each magnet has two poles, positive (a “plus”) and negative (原创 2017-10-22 00:17:25 · 556 阅读 · 0 评论 -
HDU2199二分
注意 DecimalFormat,以及real精度判断 Now,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100; Now please try your lucky.InputThe first line of the input c原创 2017-10-21 22:28:06 · 169 阅读 · 0 评论 -
分治问题,求最大子序列HDU1231
写的时候也没刻意注意是分治,写完了发现是分治 给定K个整数的序列{ N1, N2, …, NK },其任意连续子序列可表示为{ Ni, Ni+1, …, Nj },其中 1 <= i <= j <= K。最大连续子序列是所有连续子序列中元素和最大的一个, 例如给定序列{ -2, 11, -4, 13, -5, -2 },其最大连续子序列为{ 11, -4, 13 },最大和原创 2017-10-21 16:24:05 · 209 阅读 · 0 评论 -
UVA 156 如何无序的匹配单词
UVA 156 Ananagramsimport java.util.*;import java.util.regex.Matcher;import java.util.regex.Pattern;/** * Created by 95112 on 10/20/2017. */public class Ananagrams { public static void main(St原创 2017-10-20 09:08:16 · 185 阅读 · 0 评论 -
UVA10474查找优化
ArrayList.indexOf效率很低, HashMap.get()效率最高import java.util.*;/** * Created by 95112 on 10/19/2017. */public class Main { public static void main(String[] args) { Scanner scanner = new原创 2017-10-19 12:43:34 · 136 阅读 · 0 评论 -
Googel hack
偶然接触了一下web渗透,了解到一些Google搜索引擎的高级用法,很有趣,也很有用。1.基础keyword1 keyword2 关联关键字filetype:文件类型intitle:标题site:域名 返回所有包含该域名的子域名allinurl:域名包含的关键字(空格隔开,必须都包含)inurl:域名包含的关键字(空格隔开,包含其中一个也会返回)link:xx.com 返回所有与原创 2017-09-28 20:49:16 · 570 阅读 · 0 评论 -
Android7.0Messager通信分析
Messenger是一种实现跨进程通信的方法。是一种轻量级的IPC发难,底层实现是AIDL。Messenger的构造方法public Messenger(Handler target){ mTarget =target.getImessenger();}public Messenger(IBinder target){ mTarget = IMessenger.Stub.asIn原创 2017-08-31 20:53:56 · 524 阅读 · 0 评论 -
vim快速入门
直接在bash里输入 vimtutor 学习也是很快的。移动h 左移 l 右移 k 上移 j 下移普通模式按下ESC 进入 普通模式退出vim 且不保存 输入 :!q 注: 要加冒号文本编辑x 删除一个字符i 进入输入模式A 在段末输入wq 保存文件并退出(可在后面 加文件名 如 : wq try.txt)dw 删除一个单词d$ 从当前位置删除到末尾d j(hkl原创 2017-08-24 13:40:15 · 275 阅读 · 0 评论 -
正则表达式速查表
快速查表转载 2017-08-19 12:57:34 · 300 阅读 · 0 评论 -
How to operate/manage resources to meet certain objectives?
Horizontal Dynamic Scalability1. Automated Scaling Listener -monitors capacity.2. Listener takes decision based on pre-defined scaling policy.3. Listener replicates resources.ELASTIC RESOURCE CAPAC原创 2017-07-31 10:39:59 · 351 阅读 · 0 评论 -
UVA10815 Andy`s first dictionary
import java.util.ArrayList;import java.util.Collections;import java.util.Scanner;import java.util.regex.Matcher;import java.util.regex.Pattern;/** * Created by 95112 on 10/19/2017. */public clas原创 2017-10-20 09:13:40 · 429 阅读 · 0 评论 -
UVA540 TeamQueue
双队列的思想去实现 TeamQueueimport java.util.ArrayList;import java.util.HashMap;import java.util.LinkedList;import java.util.Scanner;/** * Created by 95112 on 10/20/2017. */public class TeamQueueSecond {原创 2017-10-20 14:02:51 · 260 阅读 · 2 评论 -
分治问题CodeForces768B大数
分治的思想,二分法,采用BigInteger解决大数 Jon fought bravely to rescue the wildlings who were attacked by the white-walkers at Hardhome. On his arrival, Sam tells him that he wants to go to Oldtown to train at the原创 2017-10-21 16:20:46 · 477 阅读 · 0 评论 -
N - FATE HDU - 2159
最近xhd正在玩一款叫做FATE的游戏,为了得到极品装备,xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感,但又不得不通过杀怪来升完这最后一级。现在的问题是,xhd升掉最后一级还需n的经验值,xhd还留有m的忍耐度,每杀一个怪xhd会得到相应的经验,并减掉相应的忍耐度。当忍耐度降到0或者0以下时,xhd就不会玩这游戏。xhd还说了他最多只杀s只怪。请问他能升掉这最后一级吗? Inpu原创 2017-10-29 12:29:41 · 212 阅读 · 0 评论 -
动态规划M - I NEED A OFFER! HDU - 1203
Speakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要在他的经济承受范围内)。每个学校都有不同的申请费用a(万美元),并且Speakless估计了他得到这个学校offer的可能性b。不同学校之间原创 2017-10-29 10:59:46 · 251 阅读 · 0 评论 -
分治问题POJ1854_构造回文
题目A palindrome is a string of symbols that is equal to itself when reversed. Given an input string, not necessarily a palindrome, compute the number of swaps necessary to transform the string into a pa原创 2017-10-20 20:26:27 · 918 阅读 · 0 评论 -
动态规划L - 免费馅饼 HDU - 1176
都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中是个身手敏捷的高手,但在现实中运动神经特别迟钝,原创 2017-10-28 14:01:26 · 254 阅读 · 0 评论 -
动态规划K - 数塔 HDU - 2084 最经典入门
在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的: 有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少? 已经告诉你了,这是个DP的题目,你能AC吗? Input 输入数据首先包括一个整数C,表示测试实例的个数,每个测试实例的第一行是一个整数N(1 <= N <= 100),表示数塔的高度,接下来用N行数字表示数塔,其中第i行有原创 2017-10-28 11:34:46 · 229 阅读 · 0 评论 -
动态规划J - Big Event in HDU HDU - 1171
Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don’t know that Computer College had ever been split into Computer College and Software College in 2002. T原创 2017-10-28 11:11:14 · 198 阅读 · 0 评论 -
UVA400 Unix ls
字典序,直接套用的Collections.sort()进行快速排序import java.util.ArrayList;import java.util.Collections;import java.util.Scanner;/** * Created by 95112 on 10/20/2017. */public class Unix_ls { public static原创 2017-10-20 16:17:42 · 177 阅读 · 0 评论 -
单例模式
单例模式 单例模式是为了保证对象的唯一性。通过限制对象的建立来实现的。public class Single{ private static Single single = null; private Single(){ } //将构造函数私有化,限制对象建立 public static Single getInst原创 2017-07-09 19:51:39 · 205 阅读 · 0 评论