classic_YZ-CSDN博客

原创 jenkins 自动构建项目错误: 编码EUC_CN的不可映射字符

jenkins 自动构建项目时报错：错误: 编码EUC_CN的不可映射字符解决：在pom.xml里面加上 UTF-8

2017-08-04 16:29:35 2651

原创 Eclipse 用Maven 编译错误 Dynamic Web Module 3.1 requires Java 1.7 or newer

Eclipse Maven Dynamic Web Module 3.1 requires Java 1.7 or newer这是由于你的 Maven 编译级别低，而你导入jdk高于它的依赖包：可查看 Eclipse 的 Navigator 视图下该项目的 .classpath 文件解决办法：使用 maven-compiler-plugin 将 maven 编译级别

2017-07-19 16:03:35 291

原创 EasyUI 问题小记

1.当使用datagrid时发现，当pagesize是10，数据有11条时，会第一页会显示11条数据，第二页也是会显示11条数据。解决方案：给datagrid加上： $("#dg").datagrid({loadFilter:pagerFilter}) function pagerFilter(data){ if (typeof data.

2017-03-08 16:37:10 432

原创通过maven搭建spring MVC问题小记

maven 知识：1)pom.xml标签意义：modelVersion：这个XML文件所使用的POM格式的版本groupId：相当于这个project的所有者或者机构的一个标识，一般是com.company.xxx这种格式artifactId：这个project最后所生成的文档(jar、war)的名字，比如对于junit这个开源的project，它的ar

2017-03-06 15:11:09 315

原创建立maven项目

新建maven项目1.File->New->Maven Project(如果没有，请去other查找)2.选择项目location3.选择webapp4.输入Group ID和 Artifact ID，以及Package Group ID一般写大项目名称。Artifact ID是子项目名称。 Package是默认给你建一个包，不

2017-03-06 10:51:46 458

原创 POJ 1661 Help Jimmy(DP,注意边界)

Help JimmyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9399 Accepted: 3025Description"Help Jimmy" 是在下图所示的场景上完成的游戏。场景中包括多个长度和高度各不相同的平台。地面是最低的平台

2015-08-01 11:20:43 685

原创 hdu 5316Magician (线段树)

MagicianTime Limit: 18000/9000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1067 Accepted Submission(s): 283Problem DescriptionFantasy magicians

2015-07-29 11:44:03 672 1

原创 2015 Multi-University Training Contest 3 1002 RGCDQ（hdu5317）

#include#include#include#include#include#include#include#include#include#include#includeusing namespace std; #define INF 0x7fffffff//vector f;int f[100000];int countt;bool num[1000010

2015-07-29 09:36:31 232

原创 HDU 1074 Doing Homework

看了网上代码也算是AC了。。。#include#include#include#include#include#include#include#include#include#include#includetypedef long long LL; using namespace std; #define INF 0x7fffffffconst int MAX=

2015-07-28 09:48:40 203

原创 HDU 1069 Monkey and Banana（DP）

就是找最高递减子序列。排下序就好。#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define INF 0x7fffffffstruct node{int x,y,z;}num[333];int

2015-07-28 09:44:44 338

原创 HDU 1024 Max Sum Plus Plus（DP，）

给m,n,然后n个数，分成互不相交的m段，问各段相加最大值。#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define MAXN 1000010#define INF 0x7fffffffint

2015-07-28 09:42:54 564

转载优先队列

#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;struct node{ friend bool operator { return n1.p

2015-07-03 10:31:03 261

原创 ACM的资料（1）

(1)map的使用（Uva508）#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int maxn=9999999; mapchar, string> morse; ma

2015-07-03 10:26:14 353

原创 ZOJ 3870 Team Formation（浙江省第12届ACM省赛第二题）

ZOJ 3870 Team Formation（浙江省第12届ACM省赛第二题）For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team fromN students of his university.Edward knows the skill level of each student. He has fo

2015-04-26 14:05:01 784

原创 PAT 1007. Maximum Subsequence Sum

#include#include#include#include#includeusing 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

2015-03-10 18:16:58 324

原创 PAT 1080Graduate Admission

#include #include#include#include#includeusing 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

2015-03-05 19:25:47 279

原创 PAT 1082

#include #include#include#include#includeusing 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","

2015-03-04 20:24:21 403

原创 PAT 1009. Product of Polynomials

#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(){ //

2015-02-27 15:01:59 346

原创 PAT 1003. Emergency

#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

2015-02-27 14:11:40 294

原创 PAT 1002. A+B for Polynomials

#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("

2015-02-27 14:10:53 226

原创 PAT 1001 A+B Format

#include #include #include #include #include #include #include #include #include #include #include using namespace std;int main(){ //freopen("G://test.txt","r",stdin); int a,b,sum,v

2015-02-27 14:10:21 313

原创 HDU5170 GTY's math problem

这题主要是注意精度...方法一：#include#include#include#include#includeusing namespace std;#define jd 1e-12 int main(){ //freopen("G://test.txt","r",stdin); double a,b,c,d; while(scanf("%lf%l

2015-02-08 11:09:42 434

原创 HDU5163Taking Bus（水题）

用画图工具画画线段就能明显看出来#include#include#include#include#include#includeusing namespace std;__int64 shu[100010];int main(){ // freopen("G://test.txt","r",stdin); int t; int n,m; scan

2015-01-25 09:03:39 490

原创 HDU5159 Card

CardTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 429 Accepted Submission(s): 163Special JudgeProblem DescriptionThere are x c

2015-01-24 11:13:09 452

转载 HDU 5155 Harry And Magic Box --DP

#include #include #include #include #include #include #define Mod 1000000007#define lll __int64using namespace std;lll c[55][55];lll dp[55][55];void calc(){ for(int i=0;i<=51;i++)

2015-01-23 19:43:24 365

原创 489F. Special Matrices（dp）

dp[i][j][k]表示第i行状态，有j个还需要2个1，有k个爱需要1个1，但是因为空间需求太大，所以使用滚动数组。#include#include#include#include#include#includeusing namespace std;__int64 dp[2][505][505];int main(){ //freopen("G://test.txt","

2015-01-23 10:31:10 364

原创 HDU5124 lines(离散)

#include#include#include#include#include#include#includeusing namespace std;#define MAXN 100mapa,b;int main(){ //freopen("G://test.txt","r",stdin); int t,i,j,k,n,temp1,temp2; sca

2014-12-20 14:16:11 303

原创 poj 2192 Zipper （DP）

#include #include #include #include #include #include #include #include #include #include #define LL long longint dp[1001][1001];char str1[1001],str2[1001],str3[1001];int main(){ //freo

2014-12-20 13:40:08 265

原创后缀表达式转化及求值

#include#include#include#include#includeusing namespace std;#define MAXN 111mapyxj;//优先级char shi[MAXN];char houzui[MAXN];int count1=0,count2=0,len;void init(){yxj['+']=1;yxj['-']=1;yxj['

2014-12-04 17:59:21 403

原创城市链表

#include#include#include#include#includeusing namespace std;#define MAXN 100struct p{int x,y;char name[20];p* next;p* prec;}head,cend;int n,x[MAXN+2],y[MAXN+2];char name[MAXN][20];void

2014-12-04 17:55:53 1793 1

原创 HDU 5135 Little Zu Chongzhi's Triangles(状态压缩)

#include#include#include#include#include#includeusing namespace std;struct p{int x;int y;int z;double S;}point[232];double dian[15];int c;double dp[10000];double mianji(int a,int b,i

2014-12-04 16:58:38 364

Y Z go~go~go~