Twillz-CSDN博客

原创 Spring MVC 超详细学习笔记

Spring MVC介绍MVCM：Model 封装实体和处理业务逻辑V：View 展示界面C：Controller 调度展示，分发请求Spring MVC概述轻量级java MVC框架支持REStful编程风格完成了Servelet共有的行为快速入门引入依赖并指定打包为war包pom.xml <packaging>war</packaging> <dependencies> <!-- https://mvnr

2021-11-29 11:51:00 425

原创 IDEA android 创建新项目报错

原因是compileSdkVersion 26targetSdkVersion 26和compile 'com.android.support:appcompat-v7:26+'不一致改成一致的就行了

2019-07-06 20:30:26 726

原创 nodejieba的配置（windows）

三条命令就OK其中出了很多岔子，由于翻墙啥的出的错也不想说了，能用就行 npm install --global --production windows-build-toolsnpm install -g node-gypnpm --registry=http://r.cnpmjs.org install nodejieba ...

2019-01-25 00:31:37 977 1

原创如何在移动硬盘上安装Linux 、利用sudo命令配置安装codeblocks

网上各种复杂的教程简直太麻烦了，干脆来个一条龙服务好了需要准备的硬件:一个8G左右的U盘 (一会儿要格式化的，所以要事先备份U盘里的内容) 一个移动硬盘需要准备的软件：UltraISOhttp://soft.onlinedown.net/soft/631992.htm Linux的iso文件https://mirrors.tuna.tsinghua.edu.cn...

2018-04-23 12:13:42 1361 4

转载图论题集

=============================以下是最小生成树+并查集====================================== 【HDU】 1213 How Many Tables 基础并查集★ 1272 小希的迷宫基础并查集★ 1325&&poj1308 Is It A Tree?

2017-12-04 13:44:27 631

原创 POJ 3335（半平面交—判断多边形的核是否存在）

Rotating Scoreboard Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 7444 Accepted: 2977 DescriptionThis year, ACM/ICPC World finals will be held in a hall in form of a simple pol

2017-12-02 15:30:43 392

原创 POJ 1228 Grandpa's Estate

Grandpa’s Estate Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14447 Accepted: 4040 DescriptionBeing the only living descendant of his grandfather, Kamran the Believer inher

2017-11-28 23:04:47 226

原创 POJ 2074(视线与障碍物+求直线和线段交点)

Line of Sight Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 4496 Accepted: 1393 DescriptionAn architect is very proud of his new home and wants to be sure it can be seen by peo

2017-11-23 22:46:20 486

转载 POJ 1584（判断凸包+点和凸多边形关系+圆和凸多边形关系）

题意和做法转载自優YoU http://user.qzone.qq.com/289065406/blog/1309142308 大致题意：按照顺时针或逆时针方向输入一个n边形的顶点坐标集，先判断这个n边形是否为凸包。再给定一个圆形（圆心坐标和半径），判断这个圆是否完全在n变形内部。解题思路：题意已经很直白了。。就是那个思路。。。注意输入完顶点集后，要封闭多边形，方便后面枚举边

2017-11-23 13:19:47 553

原创 POJ 1265 (Pick 公式+求任意多边形面积+顶点多边形的边整点个数)

Area Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7049 Accepted: 3025 DescriptionBeing well known for its highly innovative products, Merck would definitely be a good target f

2017-11-21 19:54:47 738

原创 POJ 1696 Space Ant(极角排序&&叉积)

Space Ant Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 4744 Accepted: 2968 DescriptionThe most exciting space discovery occurred at the end of the 20th century. In 1999, scien

2017-11-21 16:32:48 264

原创 POJ 1410 Intersection（矩形和线段的交，线段的交）

Intersection Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 15600 Accepted: 4069 DescriptionYou are to write a program that has to decide whether a given line segment interse

2017-11-20 22:59:32 299

原创 POJ 2653 (判断线段相交)

Pick-up sticks Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 14044 Accepted: 5328 DescriptionStan has n sticks of various length. He throws them one at a time on the floor i

2017-11-20 20:18:13 286

原创 POJ 3304 （判断直线和线段的交）

Segments Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15777 Accepted: 5011 DescriptionGiven n segments in the two dimensional space, write a program, which determines if th

2017-11-19 14:22:20 339

原创 POJ 1269 Intresting Lines（直线之间的关系及求交点）

Intersecting Lines Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17023 Accepted: 7325 DescriptionWe all know that a pair of distinct points on a plane defines a line and tha

2017-11-19 10:27:18 253

转载计算几何入门题推荐

POJ 计算几何入门题目推荐（转）其实也谈不上推荐，只是自己做过的题目而已，甚至有的题目尚未AC，让在挣扎中。之所以推荐计算几何题，是因为，本人感觉ACM各种算法中计算几何算是比较实际的算法，在很多领域有着重要的用途（例如本人的专业，GIS）。以后若有机会，我会补充、完善这个列表。计算几何题的特点与做题要领： 1.大部分不会很难，少部分题目思路很巧妙 2.做计算几何题目，模板很重

2017-11-19 10:06:43 386

原创 POJ 2318 Toys（判断点在直线的方向）

TOYS Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16656 Accepted: 7994 DescriptionCalculate the number of toys that land in each bin of a partitioned toy box. Mom and dad

2017-11-18 20:26:55 277

原创 CF #443 C Short Program

C. Short Program time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Petya learned a new programming language CALPAS. A program in this langua

2017-11-15 12:06:04 300

原创 POJ 2437 Muddy Roads(贪心最少固长线段覆盖区间)

Language: Muddy roads Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3389 Accepted: 1557 DescriptionFarmer John has a problem: the dirt road from his farm to town has suffered

2017-11-14 15:57:59 497

原创 POJ 1328 Radar Installation(贪心——最少区间选点覆盖)

Radar Installation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 93549 Accepted: 20884 DescriptionAssume the coasting is an infinite straight line. Land is in one side of co

2017-11-14 14:18:03 329

原创 HDU 2037 今年暑假不AC(贪心最多不相交区间)

今年暑假不ACTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 62857 Accepted Submission(s): 33954Problem Description “今年暑假不AC？” “是的。” “那你干什么呢？”

2017-11-13 22:40:49 195

原创 HDU 1789 Doing Homework Again(贪心)

Doing Homework againTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 15450 Accepted Submission(s): 9013Problem Description Ignatius has just

2017-11-13 22:06:29 169

原创 HDU 1074 Doing Homework（状压dp+记录路径）

Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10363 Accepted Submission(s): 4997Problem Description Ignatius has just come

2017-11-13 19:25:25 207

原创 HDU 1050 Moving Tables(贪心)

The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 200 rooms each on the north side and south side along the corrid

2017-10-26 14:39:58 292

原创文章标题

Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 19461 Accepted: 8670 DescriptionCows are such finicky eaters. Each cow has a preference for certain foods and drinks, an

2017-09-25 12:11:13 181

原创 UVA 796 Critical Links(Tarjan求无向图中的桥)

桥：割边，即去掉之后原本连通的分支不再连通求法：和割点差不多只要 dfn[i]小于low[j],则ij就是割边注意这题的输出格式，格式错误导致的wa了好几次，gg…..输出格式只要复制就可以了啊……. 还要按第一个输出点升序排序。。。。In a computer network a link L, which interconnects two servers, is consider

2017-09-19 08:36:30 416

原创 UVA 315 Network(Tarjan求无向图割点)

割点：删除该点和相关边，原来的连通图能变得不连通的点求法：当节点i是根（搜索起点）时，只要它的孩子多于两个，那么它就是割点，不用考虑形成环的情况，因为在遍历另一个形成环的点的孩子时，就已经从第一个形成环的孩子遍历到了它当节点i不是根的时候，它的孩子是j，当dfn[i]>=low[j]时，就是割点，因为当dfn[i]#include <iostream>#include <cstdio>#

2017-09-18 21:54:14 463

原创 HDU 1269 迷宫城堡（Tarjan or Kosaraju模板）

迷宫城堡Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17917 Accepted Submission(s): 7852Problem Description 为了训练小希的方向感，Gardon建立了一座大城堡，里面有N个房间

2017-09-18 15:16:17 534

原创 POJ 1236(强连通分量+Kosaraju)

Limit: 1000MS Memory Limit: 10000K Total Submissions: 19625 Accepted: 7732 DescriptionA number of schools are connected to a computer network. Agreements have been developed among those s

2017-09-18 11:23:58 582

原创 HDU 5536（01字典树）

John is a manager of a CPU chip factory, the factory produces lots of chips everyday. To manage large amounts of products, every processor has a serial number. More specifically, the factory produces n

2017-08-23 00:00:29 315

原创 HDU 3336 Count the strings(KMP+DP)

It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example: s: “abab

2017-08-22 23:11:11 236

原创 HDU 1358 Peroid(KMP和循环节)

For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <

2017-08-22 15:43:30 381

原创 HDU 3746 Cyclic Nacklace (KMP和循环节)

CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thinking about how to

2017-08-22 15:38:30 325

原创 HDU 2087 剪花布条(KMP查找不交叉区间的模式串个数)

一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图案。对于给定的花布条和小饰条，计算一下能从花布条中尽可能剪出几块小饰条来呢？ Input 输入中含有一些数据，分别是成对出现的花布条和小饰条，其布条都是用可见ASCII字符表示的，可见的ASCII字符有多少个，布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长。如果遇见#字符，则不再进行工作。 Output

2017-08-22 15:30:45 212

原创 HDU 1686 Oulipo (KMP查找可交叉区间模式串)

The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter ‘e’. He was a member of the Oulipo group. A quote from the book: Tout avait Pair normal, mais tout s’af

2017-08-22 15:28:52 230

原创 HDU 1711 Number Sequence (KMP模板)

Given two sequences of numbers : a[1], a[2], …… , a[N], and b[1], b[2], …… , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], …… , a[K

2017-08-22 15:25:17 189

原创 Frogs(容斥+数论)

There are mm stones lying on a circle, and nn frogs are jumping over them. The stones are numbered from 00 to m−1m−1 and the frogs are numbered from 11 to nn. The ii-th frog can jump over exactly aia

2017-08-16 22:02:12 564

原创 Watto and Mechanism（字符串hash算法）

Watto, the owner of a spare parts store, has recently got an order for the mechanism that can process strings in a certain way. Initially the memory of the mechanism is filled with n strings. Then the

2017-08-16 00:51:43 690

原创 LCA 模板

A rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figure, each node is labeled with an integer from {1, 2,…,16}. Node 8 is the root of

2017-08-11 14:22:21 229

原创 (线段树+dfs序)

百度科技园内有nn个零食机，零食机之间通过n−1n−1条路相互连通。每个零食机都有一个值vv，表示为小度熊提供零食的价值。由于零食被频繁的消耗和补充，零食机的价值vv会时常发生变化。小度熊只能从编号为0的零食机出发，并且每个零食机至多经过一次。另外，小度熊会对某个零食机的零食有所偏爱，要求路线上必须有那个零食机。为小度熊规划一个路线，使得路线上的价值总和最大。 Input 输入数据第一行是

2017-08-11 14:16:17 582

空空如也

空空如也