C++ (Cpp) intervalSum Examples

Example #1

File: Algorithms_Search_Techniques_04_Branch_and_Bound.cpp Project: 2dev2/ArabicCompetitiveProgramming

	//determine dimensions of small and large intervals and calculate F+(MAX), F-(SMALL) intervals.
	void calcTightUpperBound() {
		int score_plus =  intervalSum(pos, intervalStart[Left], intervalEnd[Right]);

		int score_mins =  0;
		if(intervalEnd[Left] <= intervalStart[Right])	// check if there is a common interval
			score_mins = intervalSum(neg, intervalEnd[Left], intervalStart[Right]);

		upperbound = score_plus + score_mins;
	}

Example #2

File: Algorithms_Search_Techniques_04_Branch_and_Bound.cpp Project: 2dev2/ArabicCompetitiveProgramming

	//determine dimensions of small and large intervals and calculate F+(MAX), F-(SMALL) intervals.
	void calcNotTightUpperBound() {

		if(isLeafNode())
			return calcTightUpperBound();

		int score_plus =  intervalSum(pos, intervalStart[Left], intervalEnd[Right]);

		upperbound = score_plus;
	}

Example #3

File: ArrayIntervalSum.cpp Project: cdht/Algorithm

int main()
{
	vector<int> vec = {1,2,7,8,5};
	vector<Interval> queries = {Interval(0,4),Interval(1,2),Interval(2,4)};
	
	vector<long long> ret = intervalSum(vec,queries);
	for(auto i : ret)
	{
		cout << i << endl;
	}
}

Example #4

File: IntervalTree (+, +).cpp Project: Dawidsoni/programming-competitions

int main() {
    scanf("%d", &count);
    for(int i = 0; i < count; i++) {
        scanf("%d", &tree[i]);
    }
    createTree();
    scanf("%d", &nCount);
    for(int i = 0; i < nCount; i++) {
        scanf("%d", &isIncrement);
        if(isIncrement == true) {
            scanf("%d%d%d", &fInd, &tInd, &o_i);
            increment(fInd,tInd,o_i);
        }else {
            scanf("%d%d", &fInd, &tInd);
            printf("%d\n", intervalSum(fInd,tInd));
        }
    }
    return 0;
}

Example #5

File: IntervalSum_Medium.cpp Project: flameshimmer/Lint2015

        void Main()
        {
			vector<int> A = { 1, 2, 7, 8, 5 };
			vector<Interval> queries = { { 1, 2 }, { 0, 4 }, { 2, 4 } };
			print(intervalSum(A, queries));
        }