- 博客(14)
- 资源 (5)
- 问答 (1)
- 收藏
- 关注
RSS订阅原创 算法马拉松8(差和问题)
差和问题 有一个集合S，初始状态下有n个元素，对他进行如下操作： 1、向S里面添加一个值为v的元素。输入格式为1v 2、向S里面删除一个值为v的元素。输入格式为2v 3、询问S里面的元素两两之差绝对值之和。输入格式为3 对于样例， 操作3，|1-2|+|1-3|+|2-3|=4 操作1 4之后，集合中的数字为1 2 3 4 操作3，|1-2|+|1-3|+|2-3|+|1
2015-11-28 00:56:00
959
原创 1188 - Fast Queries (莫队算法)
1188 - Fast Queries PDF (English) Statistics Forum Time Limit: 3 second(s) Memory Limit: 64 MB Given an array of N integers indexed from 1 toN, and
2015-11-25 11:53:53
990
原创 1100 - Again Array Queries (鸽笼定理)
1100 - Again Array Queries PDF (English) Statistics Forum Time Limit: 3 second(s) Memory Limit: 32 MB Given an array with n integers, and you are giv
2015-11-25 11:47:00
838
原创 1044 - Palindrome Partitioning (记忆化搜索乱搞)
1044 - Palindrome Partitioning PDF (English) Statistics Forum Time Limit: 1 second(s) Memory Limit: 32 MB A palindrome partition is the partitioning of
2015-11-21 02:45:14
610
原创 1031 - Easy Game (记忆化搜索)
1031 - Easy Game PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB You are playing a two player game. Initially there are nin
2015-11-20 23:13:11
599
原创 Java的重写与调用父类方法问题
一. Java重写父类方法 class Father{ public void tostring() { System.out.println("Hello!"); } } class Sun extends Father{ public void tostring(){ System.out.println("xdlove!"); } public void Super_t
2015-11-18 10:41:17
6949
原创 C. Wilbur and Points(简单贪心加合法性判断)
C. Wilbur and Points Wilbur is playing with a set of n points on the coordinate plane. All points have non-negative integer coordinates. Moreover, if some point (x, y) belongs to the set, then
2015-11-16 10:15:56
1125
原创 D. Igor In the Museum(简单DFS)
先预处理出每一个联通块的答案,然后查询时就可以O(1)出答案; /* *********************************************** Author :xdlove Created Time :2015年11月15日 星期日 16时47分40秒 File Name :xdlove/codeforces/Educational_Codeforc
2015-11-15 17:11:13
898
原创 C. Nearest vectors(卡精度,恶心)
/* *********************************************** Author :xdlove Created Time :2015年11月13日 星期五 23时24分49秒 File Name :xdlove/codeforces/Educational_Codeforces_Round_1/C/C.cpp *************
2015-11-15 16:32:38
924
原创 Testing Round #12
A. Divisibility Find the number of k-divisible numbers on the segment [a, b]. In other words you need to find the number of such integer values x that a ≤ x ≤ b and x is divisible by k.
2015-11-12 13:38:28
646
原创 1233 - Coin Change (III)
1233 - Coin Change (III) PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB In a strange shop there are n types of coins of val
2015-11-04 13:06:32
582
原创 1232 - Coin Change (II)
1232 - Coin Change (II) PDF (English) Statistics Forum Time Limit: 1 second(s) Memory Limit: 32 MB In a strange shop there are n types of coins of valu
2015-11-04 12:08:28
645
广工2015编译原理PL/0课设
2015-12-19
C++中的STL标准库map为什么是用红黑树，而不是用其它的平衡二叉搜索树
2016-05-19
TA创建的收藏夹 TA关注的收藏夹
TA关注的人