https://software.intel.com/en-us/blogs/2012/11/30/calculating-a-bearing-between-points-in-location-aware-appsSubmitted
by John Mechalas (... on Fri, 1...
分类:
移动开发 时间:
2014-05-26 20:07:36
阅读次数:
401
Problem Description
Today is Yukari's n-th birthday. Ran and Chen hold a celebration party for her. Now comes the most important part, birthday cake! But it's a big challenge for them to place n ca...
分类:
其他好文 时间:
2014-05-26 04:38:35
阅读次数:
239
Point.h
/*
* Point.h
*
* Created on: 2014年5月22日
* Author: John
*/
#include
using namespace std;
#ifndef POINT_H_
#define POINT_H_
class Point {
private:
int x;
int y;
...
分类:
编程语言 时间:
2014-05-26 03:19:07
阅读次数:
399
Agri-NetTime Limit: 1000MSMemory Limit:
10000KTotal Submissions: 37109Accepted: 14982DescriptionFarmer John has been
elected mayor of his town! One of...
分类:
其他好文 时间:
2014-05-26 02:40:43
阅读次数:
236
Kitahara Haruki has bought n apples for Touma Kazusa and Ogiso Setsuna. Now he wants to divide all the apples between the friends.
Each apple weights 100 grams or 200 grams. Of course Kitahara Haru...
分类:
其他好文 时间:
2014-05-25 09:01:36
阅读次数:
174
Kuriyama Mirai has killed many monsters and got many (namely n) stones. She numbers the stones from 1 to n.
The cost of the i-th stone is vi.
Kuriyama Mirai wants to know something about these sto...
分类:
其他好文 时间:
2014-05-25 07:24:48
阅读次数:
315
题目链接:点击打开链接
题意:有两种操作,合并集合,查询第K大集合的元素个数。(总操作次数为2*10^5)
Treap模板(静态数组)
#include
#include
#include
#include
#include
const int maxNode = 500000 + 100;
const int inf = 0x3f3f3f3f;
struct Tr...
分类:
其他好文 时间:
2014-05-24 23:18:09
阅读次数:
522
点击打开链接
题意:
集合S支持一下四种操作:
INSERT(S,x) : 如果S中没有x,则插入x
DELETE(S,x): 如果S中有x,则删除x
K-TH(S): 输出S中第K小的数
COUNT(S,x): 统计S中小于x的数有多少个
一共有Q(1 ≤ Q ≤ 200000)次操作。
Treap模板。。
#i...
分类:
其他好文 时间:
2014-05-24 18:03:11
阅读次数:
213
满足二叉查找树的存储规则。类似折半查找:import
javax.management.remote.rmi._RMIConnectionImpl_Tie;/** * Created by John on
14-5-22. */public class IntTree { private st...
分类:
编程语言 时间:
2014-05-24 08:04:52
阅读次数:
300