- 博客(8)
- 收藏
- 关注
RSS订阅原创 2015年浙江省赛
#include#include#include#include#include#include#include#include#include#include#include#define CLEAR(a) memset((a),0,sizeof((a)))using namespace std;typedef long long LL;const double
2015-04-25 20:54:17
293
转载 矩阵乘法模版
http://www.cnblogs.com/proverbs/archive/2012/10/10/2718799.htmlpoj 3070#include #include #include #include #define SIZE 4 #define mod 10000using namespace std;struct MATRIX{ i
2015-04-11 23:00:15
174
原创 Bestcoder #37 - 1 hdu5202 WA简直拉低智商
#include#include#include#include#include#include#include#include#include#include#include#define CLEAR(a) memset((a),0,sizeof((a))) using namespace std; typedef long long LL;const doubl
2015-04-11 22:31:52
231
原创 A Simple Problem with Integers
DescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is
2015-04-07 17:36:29
220
原创 依据judge返回结果的查错表
WA运行时间较长➡️最后若干个数据点出错➡️整型变量越界？换用long long极端（极大）情况未处理？0ms WA➡️第一个数据点出错➡️初始条件（下界）未处理？PE空格／回车不匹配RE（ACCESS_VIOLATION）数组下标越界开辟的数组太小？冗余空间浪费？STL模版类无法承受的数据量？STL模版类函数误用？R
2015-04-06 13:59:27
300
原创 zoj 3031 / cdoj 430 - Robotruck - Southwestern Europe 2007
O(n^2)代码：#define CLEAR(a) memset((a),0,sizeof((a)))const int maxn=1e5+10;const int inf=1<<30;struct Point{ int x,y; Point(){x=0;y=0;}; Point(int x,int y){this->x=x;this->y=y;};} po
2015-04-06 13:45:22
312
原创 Bestcoder #36 hash
1002 Gunner Time Limit: 8000/4000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionLong long ago, there is a gunner whose name is Jack. He likes to go hunting very
2015-04-04 22:03:12
247
原创 线段树中的TLE，RE杂碎问题
可引起RE(ACCESS_VIOLATION)的建树操作{ int k=1; L[1]=1;R[1]=maxn; for(int i=1;i<=maxn;i++) if (L[i]<R[i]) { k++;L[k]=L[i];R[k]=(L[i]+R[i])/2; k++;L[k]=(L[i]+R[i])/2+1;R[k]
2015-04-02 16:48:47
846
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人