CharlotteRong

// 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

/**  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

// 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

用线段树做的，感觉超过时间限制了，为（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,

// 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);

// 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

// 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);

// 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;

自己的算法是将区间按照start排序，依次看排序后的每个节点，在之后结点的start序列中二分查找当前结点end点的位置，位置差之和即可。 但是下面的算法更简单。 http://blog.youkuaiyun.com/caopengcs/article/details/9327069 // you can also use includes, for example: // #include