- 博客(57)
- 收藏
- 关注
原创 Tomcat错误
在Tomcat服务器上部署项目出现500错误,显示项目实例化servlet失败,原因是xml文件里配置的<servlet>中类的包名路径错误,不能包含项目名.scr.
2020-08-04 20:03:20 114
原创 CSU 1350 To Add Which?
这题我的思路是先找到序列中最大的值,然后改变它两边邻居的值,用sum加起来,然后利用二分知识,在找左边和右边的最大值,然后也是改变它们两边邻居的值,如此直到序列最小和它邻居的值符合题意。需要注意的是边界问题,还有处理好序列的两头!#include <iostream>#include <stdio.h>#include <stdlib.h>#incl...
2018-08-16 20:12:21 161
原创 J - 病毒 CSU - 1120
最长递增公共子序列。#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int n, m, t, i, j,
2017-08-30 18:28:03 238
原创 D - 复盘拉火车 CSU - 1898
没什么好说的,注意边界问题。#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int t, n, i, j,
2017-08-27 20:35:26 408
原创 E - GirlCat
水题,可以暴力for加if#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int T, n, i, j,m
2017-08-26 13:57:09 257
原创 L - Tic-Tac-Toe FZU - 2283
规律题,博主无耻暴力。。。。。#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int n, i, j, t
2017-08-24 18:43:55 184
原创 F - 打怪升级
第一种药直接吃,第二种看情况,寻求最优,所以用dfs做,注意只要自己力量大于100了就横扫所有敌人,注意时间加减。#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable
2017-08-22 20:24:08 295
原创 A - Enterprising Escape
水题,注意吸回车的getchr(),不加没有值,谁让是scanf呢。#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace
2017-08-21 20:51:58 242
原创 C - Knapsack problem
传统的01背包,但是改进了一点,就是重量太大无法用数组存,但是价值很小,可以换个角度思考,就是让重量与价值交换,求在最大容量下的最大价值,或者说是在装下J的价值下的最大容量。#include#include#include#include#include#include#include#include#include#include#include#include#in
2017-08-21 18:40:40 208
原创 最长递增子序列
水题#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int a[1010];int dp[1010];
2017-08-21 10:39:16 134
原创 C - Common Subsequence
求最大公共子序列,类似记忆动态规划。#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;char s1[101
2017-08-20 20:38:10 321
原创 A - The Triangle
我为为人人代码#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int a[110][110];int d
2017-08-20 20:02:07 253
原创 A - Salty Fish
注意的是先求所有出现的1的总数,在求最大改变区间1的总数,然后两个相加就可以了。#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using name
2017-08-20 18:13:32 246
原创 B - Can you solve this equation?
#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;double y;double find(double x)
2017-08-18 17:20:31 269
原创 G - 好老师
#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int main(){ int n,i,q,x,t=0,l
2017-08-17 22:10:04 189
原创 A - Bad Hair Day
#include#include#include#include#include#include#include#include#include#include#include#include using namespace std;stack s;int main(){ int n,i; cin.sync_with_stdio(false); while (c
2017-08-17 12:25:12 391
原创 X - 位置信息挖掘
典型的种类并查集。#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;const int maxs = 100
2017-08-16 16:19:37 190
原创 C - Strange fuction
这题我用三分来做。#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;double EPS = 1e-6;double fin
2017-08-16 14:27:27 223
原创 A - Can you find it?
这题用二分做很水,关键是求两个数组的之和,求和完后排序,然和剩下那个数组枚举,两个数组二分就可以了。#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using nam
2017-08-16 13:32:23 159
原创 D - Color the ball
#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;const int maxs = 1000000;int s
2017-08-16 09:52:10 164
原创 A - BST
用树状数组做就是水题。#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;const int maxs = 1
2017-08-15 15:53:26 143
原创 C - 敌兵布阵
模板题,用得线段树。#include#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int a[500010];char
2017-08-15 14:38:27 443
原创 J - Andy's First Dictionary
注意,测试样例同时按Ctrl+Z+回车键终止,不然输出不了,为什么参考博客http://blog.csdn.net/kevin_ut/article/details/8576740#include#include#include#include#include#include#include#include#include#include#include#include
2017-08-14 16:43:55 141
原创 问题 B: #103. 子串查找
真的坑这题,一般方法要超时。看到别人代码区区几行就解决了,一个while循环,不过用到了strstr这个函数。#include#include#includechar s[1000000];char ss[1000000];int main(){ int num=0,len,len1; char *p; scanf("%s",s); scanf("%s", ss); le
2017-08-14 16:05:59 307
原创 D - 炉石传说
#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int vj[1000];struct wo { int a; int b
2017-08-13 19:30:08 148
原创 H - Fence Repair
#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int main(){ int n; long long num = 0;
2017-08-12 21:30:09 185
原创 E - Team Queue
#include#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int main(){ int t, count = 1; const
2017-08-12 20:26:57 174
原创 F - Ugly Numbers
#include#include#include#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;typedef long long LL;const int coeff[3] = { 2,3,
2017-08-12 19:43:32 179
原创 B - Rails
#include#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int n;vector block[30];int t[1010];int main(){ int a, b,i,flag; while
2017-08-12 19:00:51 181
原创 A - The Blocks Problem
#include#include#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int n;vector block[30];void find(int a,int &p,int &h){ for (p = 0; p < n; p++)
2017-08-12 17:04:47 456
原创 Problem A: 2016
说实话,对于我这萌新来说真的难。。。。后面看了大牛的博客才懂的,就是n和m分别对2016取模,然后放到数组里存。#include#include#include#include#include #pragma warning(disable:4996)using namespace std;long long a[2030], b[2030];int main(){ lo
2017-08-11 20:05:48 153
原创 D - So Hard
#include#include#include#include#include#pragma warning(disable:4996)using namespace std;char s[105];int gcd(int a,int b){ if(!b) return a; return gcd(b,a%b);}int main(){ int n,i; sc
2017-08-11 13:39:44 137
原创 B - 完美的数字
最关键的就是降幂,10的15次方太大,化成10的5次方就不会超时,已知题意N=A*A*B且A=A*A*A,这样A就成10的5次方就可以不超时了,其次就是区间划分从a到b,可分为从1到a和从1到b,然后让两区间相减就得a到b的区间,这里要注意的是a-1和a,如果到a那么区间1-b与1-a相减要加1,反之不加。#include#include#include#include#pragma wa
2017-08-11 11:03:46 175
原创 Z - 奇数个的那个数
自己代码:#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int a[10000000];int main(){ int n,i; while (~scanf("%d", &n)) { int count=1,qi; for (
2017-08-09 16:57:14 211
原创 D - AAAA HDU - 1998
就是找规律,从下到右上,看是否为0,是就赋值,不是就判断自身下面的数是否为0,是就赋值,然后反复,注意右上最后一位数
2017-08-09 11:13:36 211
原创 J - 超大型LED显示屏
#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int show[10] = { 6,2,5,5,4,5,6,3,7,6 };int get(int a){ int sum = 0; if (a == 0) retur
2017-08-07 11:51:41 167
原创 C - Code Formatter
这是水题,注意的是空格只有最后才算的,中间出现的空格都不算#include#include#include#include#include #pragma warning(disable:4996)using namespace std;char s[1010];int main(){ int t; scanf("%d", &t); getcha
2017-08-04 19:31:19 215
原创 G - 悲催的移寝
#include#include#include#include#include #pragma warning(disable:4996)using namespace std;int a[100010];const double pi = 3.1415926;int main(){int t,top=0;scanf("%d", &t);whi
2017-08-02 17:18:49 202
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人