acwing算法基础课笔记6（一）

贪心算法：用局部最优解推出全局最优，难点：如何证明这样的选法解法是正确的？

一，区间问题

1.区间选点

 代码：

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1e5 + 10;

int n;

struct Range{
	int l;
	int r;
	bool operator< (const Range &W)
	{
		return r<W.r;
	} 
}range[N];

int main()
{
	cin>>n;
	for(int i=0;i<n;i++)
	{
		int l, r;
		cin>>l>>r;
		range[i] = {l, r};
	}
	sort(range, range + n);
	int res = 0, ed = -2e9;
	for(int i=0;i<n;i++)
	{
		if(range[i].l > ed)
		{
			res++;
			ed = range[i].r;
		}
	}
	cout<<res<<endl;
	return 0;
}

2.最大不相交区间数量

 代码与第一题一样

3.区间分组

 代码：

#include <iostream>
#include <queue>
#include <algorithm>

using namespace std;

const int N = 1e5 + 10;

int n;

struct Range{
	int l, r;
	bool operator<(const Range &W)
	{
		return l < W.l;
	}
}range[N];

int main()
{
	cin>>n;
	for(int i=0;i<n;i++)
	{
		int l, r;
		cin>>l>>r;
		range[i] = {l, r};
	}
	priority_queue<int, vector<int>, greater<int> > heap;
	for(int i=0;i<n;i++)
	{
		auto qj = range[i];
		if(heap.empty() || heap.top() >= qj.l) heap.push(qj.r);
		else
		{
			int t = heap.top();
			heap.pop();
			heap.push(qj.r);
		} 
	}
	cout<<heap.size()<<endl;
	return 0;
}

  4.区间覆盖

 代码：

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1e5 + 10;

int n;

struct Range{
    int l, r;
    bool operator< (const Range &W)
    {
        return l < W.l;
    }
}range[N];

int main()
{
    int st, ed;
    cin>>st>>ed;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        int l, r;
        cin>>l>>r;
        range[i] = {l, r};
    }
    sort(range, range + n);
    int res = 0;
    bool flag = false;
    for(int i=0;i<n;i++)
    {
        int j = i, r = -2e9;
        while(j < n && range[j].l <= st)
        {
            r = max(r, range[j].r);
            j++;
        }
        if(r < st)
        {
            res = -1;
            break;
        }
        res++;
        if(r >= ed)
        {
            flag = true;
            break;
        }
        i = j - 1;
        st = r;
    }
    if(!flag) res = -1;
    cout<<res<<endl;
    return 0;
}

 二，哈夫曼树

 代码：

#include <iostream>
#include <algorithm>
#include <queue>

using namespace std;

const int N = 10010;

int n;

int main()
{
	cin>>n;
	priority_queue<int, vector<int>, greater<int> > heap;
	while(n--)
	{
		int x;
		cin>>x;
		heap.push(x);
	}
	
	int res = 0;
	while(heap.size() > 1)
	{
		int a = heap.top();
		heap.pop();
		int b = heap.top();
		heap.pop();
		res += (a + b);
		heap.push(a + b);
	}
	cout<<res<<endl;
	return 0;
}