[洛谷] P2003 平板

暴搜

//#pragma GCC optimize(2)
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <string>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <ctime>
#include <vector>
#include <fstream>
#include <list>
#include <iomanip>
#include <numeric>
using namespace std;
typedef long long ll;

const int MAXN = 1e6 + 10;

struct raw
{
    ll fst, lst, high;

}arr[MAXN];

bool cmp(raw a, raw b)
{
    return a.high < b.high;
}

ll cal(double x, int N)
{
    ll rh = arr[N].high;

    for(int i = N - 1; i >= 0; i--)
    {
        if(x >= arr[i].fst && x <= arr[i].lst)
            return rh - arr[i].high;
    }
}

int main()
{
    //ios::sync_with_stdio(false);

    //cin.tie(0);     cout.tie(0);

    int T;

    ll ans = 0;

    cin>>T;

    arr[0].fst = -MAXN;

    arr[0].lst = MAXN;

    arr[0].high = 0;

    for(int i = 1; i <= T; i++)
        cin>>arr[i].high>>arr[i].fst>>arr[i].lst;

    sort(arr, arr + T + 1, cmp);
	
	for(int i = T; i > 0; i--)
    {
        ans += cal(arr[i].fst + 0.5, i);

        ans += cal(arr[i].lst - 0.5, i);
    }

    cout<<ans<<endl;

    return 0;
}