CareerCup Find a subarray

最新推荐文章于 2019-08-13 17:08:56 发布

taoqick

最新推荐文章于 2019-08-13 17:08:56 发布

阅读量758

点赞数

分类专栏： careercup c++ 算法

本文链接：https://blog.csdn.net/taoqick/article/details/19609513

版权

算法同时被 3 个专栏收录

474 篇文章 6 订阅

订阅专栏

c++

265 篇文章 1 订阅

订阅专栏

careercup

86 篇文章 0 订阅

订阅专栏

Given an array of pairs of the form <a, b>. We have to find a sub-array such that the 1st element in the pairs are in increasing order and the sum of 2nd element of the pairs in the sub-array is maximum possible

--------------------------------------------------------------------------------------------------------

Do you know what does subarray means ? It's continuous! So DP is enough like this:

int max_ending_here, max_ending_so_far = 0;
int begin, end = 0;
int begin_temp = begin;

for(int i = 1; i< pairsArray.length; i++)
{
	if(pairsArray[i-1].first < pairsArray[i].first)
	{
		if(max_ending_here < 0)
		{
			max_ending_here = pairsArray[i].second;
			begin_temp = i;
		}
		else
		{
			max_ending_here += pairsArray[i].second;
		}

		if(max_ending_here >= max_ending_so_far)
		{
			max_ending_so_far = max_ending_here;
			begin = begin_temp;
			end = i;
		}
	}
	else
	{	
		max_ending_here = 0;
		begin_temp = i; 
	}
}

If the sub-sequence is not continuous, it's similar to longest increasing sub-sequence.