<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Twillz的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Twillz</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Twillz]]></copyright><item><title><![CDATA[Spring MVC 超详细学习笔记]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/121606501</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/121606501</guid><author>Twillz</author><pubDate>Mon, 29 Nov 2021 11:51:00 +0800</pubDate><description><![CDATA[Spring MVC介绍
MVC
M：Model 封装实体和处理业务逻辑
V：View 展示界面
C：Controller 调度展示，分发请求
Spring MVC概述

轻量级java MVC框架
支持REStful编程风格
完成了Servelet共有的行为

快速入门
引入依赖并指定打包为war包
pom.xml
    

 &lt;packaging&gt;war&lt;/packaging&gt;
	&lt;dependencies&gt;
        &lt;!-- https://mvnr]]></description><category></category></item><item><title><![CDATA[IDEA android 创建新项目报错]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/94893986</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/94893986</guid><author>Twillz</author><pubDate>Sat, 06 Jul 2019 20:30:26 +0800</pubDate><description><![CDATA[原因是


compileSdkVersion 26
targetSdkVersion 26

和


compile 'com.android.support:appcompat-v7:26+'不一致

改成一致的就行了
]]></description><category></category></item><item><title><![CDATA[nodejieba的配置（windows）]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/86635413</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/86635413</guid><author>Twillz</author><pubDate>Fri, 25 Jan 2019 00:31:37 +0800</pubDate><description><![CDATA[三条命令就OK

其中出了很多岔子，由于翻墙啥的出的错也不想说了，能用就行

 


npm install --global --production windows-build-tools
npm install -g node-gyp
npm --registry=http://r.cnpmjs.org install nodejieba


 ...]]></description><category></category></item><item><title><![CDATA[如何在移动硬盘上安装Linux 、利用sudo命令配置安装codeblocks]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/80048346</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/80048346</guid><author>Twillz</author><pubDate>Mon, 23 Apr 2018 12:13:42 +0800</pubDate><description><![CDATA[网上各种复杂的教程简直太麻烦了，干脆来个一条龙服务好了

需要准备的硬件:



一个8G左右的U盘 (一会儿要格式化的，所以要事先备份U盘里的内容)
	一个移动硬盘
需要准备的软件：



UltraISOhttp://soft.onlinedown.net/soft/631992.htm
	Linux的iso文件https://mirrors.tuna.tsinghua.edu.cn...]]></description><category></category></item><item><title><![CDATA[图论题集]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78708938</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78708938</guid><author>Twillz</author><pubDate>Mon, 04 Dec 2017 13:44:27 +0800</pubDate><description><![CDATA[=============================以下是最小生成树+并查集====================================== 
【HDU】 
1213        How Many Tables         基础并查集★ 
1272        小希的迷宫           基础并查集★ 
1325&&poj1308   Is It A Tree?]]></description><category></category></item><item><title><![CDATA[POJ 3335（半平面交—判断多边形的核是否存在）]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78696130</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78696130</guid><author>Twillz</author><pubDate>Sat, 02 Dec 2017 15:30:43 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[POJ 1228 Grandpa's Estate]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78660413</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78660413</guid><author>Twillz</author><pubDate>Tue, 28 Nov 2017 23:04:47 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[POJ 2074(视线与障碍物+求直线和线段交点)]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78619961</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78619961</guid><author>Twillz</author><pubDate>Thu, 23 Nov 2017 22:46:20 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[POJ 1584（判断凸包+点和凸多边形关系+圆和凸多边形关系）]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78613744</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78613744</guid><author>Twillz</author><pubDate>Thu, 23 Nov 2017 13:19:47 +0800</pubDate><description><![CDATA[题意和做法转载自 
優YoU  http://user.qzone.qq.com/289065406/blog/1309142308 
大致题意： 
按照顺时针或逆时针方向输入一个n边形的顶点坐标集，先判断这个n边形是否为凸包。 
再给定一个圆形（圆心坐标和半径），判断这个圆是否完全在n变形内部。解题思路： 
题意已经很直白了。。就是那个思路。。。 
注意输入完顶点集后，要封闭多边形，方便后面枚举边]]></description><category></category></item><item><title><![CDATA[POJ 1265 (Pick 公式+求任意多边形面积+顶点多边形的边整点个数)]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78596231</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78596231</guid><author>Twillz</author><pubDate>Tue, 21 Nov 2017 19:54:47 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[POJ 1696 Space Ant(极角排序&&叉积)]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78594128</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78594128</guid><author>Twillz</author><pubDate>Tue, 21 Nov 2017 16:32:48 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[POJ 1410 Intersection（矩形和线段的交，线段的交）]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78587811</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78587811</guid><author>Twillz</author><pubDate>Mon, 20 Nov 2017 22:59:32 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[POJ 2653 (判断线段相交)]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78586148</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78586148</guid><author>Twillz</author><pubDate>Mon, 20 Nov 2017 20:18:13 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[POJ 3304 （判断直线和线段的交）]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78574255</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78574255</guid><author>Twillz</author><pubDate>Sun, 19 Nov 2017 14:22:20 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[POJ 1269 Intresting Lines（直线之间的关系及求交点）]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78572999</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78572999</guid><author>Twillz</author><pubDate>Sun, 19 Nov 2017 10:27:18 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[计算几何入门题推荐]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78572883</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78572883</guid><author>Twillz</author><pubDate>Sun, 19 Nov 2017 10:06:43 +0800</pubDate><description><![CDATA[POJ 计算几何入门题目推荐（转）  
     其实也谈不上推荐，只是自己做过的题目而已，甚至有的题目尚未AC，让在挣扎中。之所以推荐计算几何题，是因为，本人感觉ACM各种算法中计算几何算是比较实际的算法，在很多领域有着重要的用途（例如本人的专业，GIS）。以后若有机会，我会补充、完善这个列表。计算几何题的特点与做题要领： 
1.大部分不会很难，少部分题目思路很巧妙 
2.做计算几何题目，模板很重]]></description><category></category></item><item><title><![CDATA[POJ 2318 Toys（判断点在直线的方向）]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78570978</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78570978</guid><author>Twillz</author><pubDate>Sat, 18 Nov 2017 20:26:55 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[CF #443  C Short Program]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78539389</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78539389</guid><author>Twillz</author><pubDate>Wed, 15 Nov 2017 12:06:04 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[POJ 2437 Muddy Roads(贪心  最少固长线段覆盖区间)]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78531461</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78531461</guid><author>Twillz</author><pubDate>Tue, 14 Nov 2017 15:57:59 +0800</pubDate><description><![CDATA[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]]></description><category></category></item><item><title><![CDATA[POJ 1328  Radar Installation(贪心——最少区间选点覆盖)]]></title><link>https://blog.youkuaiyun.com/Twillz/article/details/78530093</link><guid>https://blog.youkuaiyun.com/Twillz/article/details/78530093</guid><author>Twillz</author><pubDate>Tue, 14 Nov 2017 14:18:03 +0800</pubDate><description><![CDATA[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]]></description><category></category></item></channel></rss>