algorithm
文章平均质量分 52
CharlotteRong
这个作者很懒,什么都没留下…
展开
-
Codility -- Brackets
// you can also use includes, for example: // #include #include int solution(const string &S) { // write your code in C++98 int len = S.size(); if(len<=0) return 1; // if(len == 1) re原创 2013-11-06 16:54:48 · 967 阅读 · 0 评论 -
Codility -- Fish
/** You are given two non-empty zero-indexed arrays A and B consisting of N integers. Arrays A and B represent N voracious fish in a river, ordered downstream along the flow of the river. The fi原创 2013-11-06 16:53:06 · 1414 阅读 · 0 评论 -
Codility -- grocery_store
// you can also use includes, for example: // #include #include #include #include #include "limits.h" using namespace std; void Dijster(vector >&graph, vector&dis) { dis[0] = 0; int N = d原创 2013-11-06 17:42:45 · 629 阅读 · 0 评论 -
Codility -- Genomic-range-query
用线段树做的,感觉超过时间限制了,为(n+m)lgn。 // you can also use includes, for example: // #include struct node{ int l; int r; int c; }; const int MAX = 100000+10; int count(vector&Tree, int p, int b,原创 2013-11-07 12:03:53 · 1040 阅读 · 0 评论 -
Codility -- Frog-River-One
// you can also use includes, for example: // #include int solution(int X, vector &A) { // write your code in C++98 int n = A.size(); if(X<=0) return 0; vector dis(n+1, false);原创 2013-11-07 12:23:17 · 1020 阅读 · 0 评论 -
Codility -- Triangle
// you can also use includes, for example: // #include #include #include #include #include using namespace std; void HSort(vector&A, int b, int e); void adjust(vector& A, int b, int e); int sol原创 2013-11-06 22:04:42 · 871 阅读 · 0 评论 -
Codility -- Perm-Check
// you can also use includes, for example: // #include int solution(vector &A) { // write your code in C++98 int n = A.size(); if(n<=0) return 0; vector dis(n+1, false);原创 2013-11-07 12:12:00 · 1094 阅读 · 0 评论 -
Codility -- passing cars
// you can also use includes, for example: // #include int solution(vector &A) { // write your code in C++98 int count=0; int n = A.size(); if(n<=1) return 0; int num1=0;原创 2013-11-07 10:31:30 · 985 阅读 · 0 评论 -
Codility -- Number-of-disc-intersections
自己的算法是将区间按照start排序,依次看排序后的每个节点,在之后结点的start序列中二分查找当前结点end点的位置,位置差之和即可。 但是下面的算法更简单。 http://blog.csdn.net/caopengcs/article/details/9327069 // you can also use includes, for example: // #include转载 2013-11-07 10:34:23 · 1242 阅读 · 0 评论