<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Y Z go~go~go~]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/classicshao</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; classicshao]]></copyright><item><title><![CDATA[jenkins 自动构建项目 错误: 编码EUC_CN的不可映射字符]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/76687616</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/76687616</guid><author>classicshao</author><pubDate>Fri, 04 Aug 2017 16:29:35 +0800</pubDate><description><![CDATA[jenkins 自动构建项目时报错： 错误: 编码EUC_CN的不可映射字符


解决：在pom.xml里面加上
    
        UTF-8]]></description><category></category></item><item><title><![CDATA[Eclipse 用Maven 编译错误 Dynamic Web Module 3.1 requires Java 1.7 or newer]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/75397175</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/75397175</guid><author>classicshao</author><pubDate>Wed, 19 Jul 2017 16:03:35 +0800</pubDate><description><![CDATA[Eclipse Maven Dynamic Web Module 3.1 requires Java 1.7 or newer


这是由于你的 Maven 编译级别低，而你导入jdk高于它的依赖包：可查看 Eclipse 的 Navigator 视图下该项目的 .classpath 文件



解决办法：
使用 maven-compiler-plugin 将 maven 编译级别]]></description><category></category></item><item><title><![CDATA[EasyUI 问题小记]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/60874997</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/60874997</guid><author>classicshao</author><pubDate>Wed, 08 Mar 2017 16:37:10 +0800</pubDate><description><![CDATA[1.当使用datagrid时发现，当pagesize是10，数据有11条时，会第一页会显示11条数据，第二页也是会显示11条数据。






解决方案：
     给datagrid加上：   $("#dg").datagrid({loadFilter:pagerFilter})

	function pagerFilter(data){
		if (typeof data.]]></description><category></category></item><item><title><![CDATA[通过maven搭建spring MVC问题小记]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/60578396</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/60578396</guid><author>classicshao</author><pubDate>Mon, 06 Mar 2017 15:11:09 +0800</pubDate><description><![CDATA[maven 知识：


1)

pom.xml标签意义：

modelVersion： 这个XML文件所使用的POM格式的版本
groupId： 相当于这个project的所有者或者机构的一个标识，一般是com.company.xxx这种格式
artifactId：  这个project最后所生成的文档(jar、war)的名字，比如对于junit这个开源的project，它的ar]]></description><category></category></item><item><title><![CDATA[建立maven项目]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/60571091</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/60571091</guid><author>classicshao</author><pubDate>Mon, 06 Mar 2017 10:51:46 +0800</pubDate><description><![CDATA[新建maven项目
1.File->New->Maven
 Project(如果没有，请去other查找)

2.选择项目location


3.选择webapp


4.输入Group
 ID和 Artifact ID，以及Package

 Group ID一般写大项目名称。Artifact ID是子项目名称。
        Package是默认给你建一个包，不]]></description><category></category></item><item><title><![CDATA[POJ 1661 Help Jimmy(DP,注意边界)]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/47184753</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/47184753</guid><author>classicshao</author><pubDate>Sat, 01 Aug 2015 11:20:43 +0800</pubDate><description><![CDATA[Help Jimmy




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 9399
 
Accepted: 3025




Description

"Help Jimmy" 是在下图所示的场景上完成的游戏。 


场景中包括多个长度和高度各不相同的平台。地面是最低的平台]]></description><category></category></item><item><title><![CDATA[hdu 5316Magician (线段树)]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/47124999</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/47124999</guid><author>classicshao</author><pubDate>Wed, 29 Jul 2015 11:44:03 +0800</pubDate><description><![CDATA[Magician
Time Limit: 18000/9000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1067    Accepted Submission(s): 283



Problem Description

Fantasy magicians]]></description><category></category></item><item><title><![CDATA[2015 Multi-University Training Contest 3 1002	RGCDQ（hdu5317）]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/47122281</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/47122281</guid><author>classicshao</author><pubDate>Wed, 29 Jul 2015 09:36:31 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;  
#define INF 0x7fffffff
//vector f;
int f[100000];
int countt;
bool num[1000010]]></description><category></category></item><item><title><![CDATA[HDU 1074	Doing Homework]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/47100731</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/47100731</guid><author>classicshao</author><pubDate>Tue, 28 Jul 2015 09:48:40 +0800</pubDate><description><![CDATA[看了网上代码也算是AC了。。。
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
typedef long long LL;  
using namespace std;  
#define INF 0x7fffffff
const int MAX=]]></description><category></category></item><item><title><![CDATA[HDU 1069 Monkey and Banana（DP）]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/47100629</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/47100629</guid><author>classicshao</author><pubDate>Tue, 28 Jul 2015 09:44:44 +0800</pubDate><description><![CDATA[就是找最高递减子序列。排下序就好。
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define INF 0x7fffffff
struct node{
int x,y,z;
}num[333];
int]]></description><category></category></item><item><title><![CDATA[HDU 1024 Max Sum Plus Plus（DP，）]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/47100559</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/47100559</guid><author>classicshao</author><pubDate>Tue, 28 Jul 2015 09:42:54 +0800</pubDate><description><![CDATA[给m,n,然后n个数，分成互不相交的m段，问各段相加最大值。
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define MAXN 1000010
#define INF 0x7fffffff
int ]]></description><category></category></item><item><title><![CDATA[优先队列]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/46738627</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/46738627</guid><author>classicshao</author><pubDate>Fri, 03 Jul 2015 10:31:03 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
struct node
{
    friend bool operator
    {
        return n1.p]]></description><category></category></item><item><title><![CDATA[ACM的资料（1）]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/46738565</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/46738565</guid><author>classicshao</author><pubDate>Fri, 03 Jul 2015 10:26:14 +0800</pubDate><description><![CDATA[(1)map的使用（Uva508）
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
int maxn=9999999; 
mapchar, string> morse;  
ma]]></description><category></category></item><item><title><![CDATA[ZOJ  3870 Team Formation（浙江省第12届ACM省赛第二题）]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/45287993</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/45287993</guid><author>classicshao</author><pubDate>Sun, 26 Apr 2015 14:05:01 +0800</pubDate><description><![CDATA[ZOJ  3870 Team Formation（浙江省第12届ACM省赛第二题）
For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from
N students of his university.
Edward knows the skill level of each student. He has fo]]></description><category></category></item><item><title><![CDATA[PAT 1007. Maximum Subsequence Sum]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/44178829</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/44178829</guid><author>classicshao</author><pubDate>Tue, 10 Mar 2015 18:16:58 +0800</pubDate><description><![CDATA[#include
#include
#include
#include
#include
using namespace std;
int n;
int num[10010];
int main(){
	//freopen("G://test.txt","r",stdin);
	while(scanf("%d",&n)!=EOF){
		for(int i=0;i<n;++i){
			scanf]]></description><category></category></item><item><title><![CDATA[PAT 1080Graduate Admission]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/44086449</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/44086449</guid><author>classicshao</author><pubDate>Thu, 05 Mar 2015 19:25:47 +0800</pubDate><description><![CDATA[#include 
#include
#include
#include
#include
using namespace std;
struct student{
	int ge,gi,sum,id;
	int adm[5];
}st[40100];
struct school{
int count;
vector ad;
}sc[110];

vectors[110];
int cmp(con]]></description><category></category></item><item><title><![CDATA[PAT 1082]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/44064943</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/44064943</guid><author>classicshao</author><pubDate>Wed, 04 Mar 2015 20:24:21 +0800</pubDate><description><![CDATA[#include 
#include
#include
#include
#include
using namespace std;
vector shu;
int main()
{
//	freopen("G://test.txt","r",stdin);
	char n[15];
	char *s;
	char num[11][8]={"ling","yi","er","san","si","]]></description><category></category></item><item><title><![CDATA[PAT 1009. Product of Polynomials]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/43967871</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/43967871</guid><author>classicshao</author><pubDate>Fri, 27 Feb 2015 15:01:59 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
struct p{
int ni;
double ani;
} a[15],b[15],c[2020];
int main()
{
 //]]></description><category></category></item><item><title><![CDATA[PAT 1003. Emergency]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/43967225</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/43967225</guid><author>classicshao</author><pubDate>Fri, 27 Feb 2015 14:11:40 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
int num[505][505],vit[505];
 int helper[505];
vector ljb[505];
  int ]]></description><category></category></item><item><title><![CDATA[PAT 1002. A+B for Polynomials]]></title><link>https://blog.youkuaiyun.com/classicshao/article/details/43967213</link><guid>https://blog.youkuaiyun.com/classicshao/article/details/43967213</guid><author>classicshao</author><pubDate>Fri, 27 Feb 2015 14:10:53 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
struct p{
int ni;
double ani;
} num[1010];
int main()
{
  //freopen("]]></description><category></category></item></channel></rss>