TOJ 3875 Flowerpot -- RMQ + 二分

最新推荐文章于 2019-09-23 15:56:00 发布

randygx

最新推荐文章于 2019-09-23 15:56:00 发布

阅读量476

点赞数

分类专栏： ACM 文章标签：二分查找 RMQ Sparse_Table

本文链接：https://blog.csdn.net/randygx/article/details/26099011

版权

ACM 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

题目链接：http://acm.tzc.edu.cn/acmhome/problemdetail.do?&method=showdetail&id=3875

题目大意：给定平面上n个点，求最小的横坐标跨度使跨度内纵坐标差值不小于给定值

分析：把所有点按x坐标排序后，枚举每一个点作为区间终点。对于每一次枚举，二分查找起点，然后判断区间最大最小值之差是否满足条件。（显然区间内最大最小值具有单调性，所有可以二分查找）。枚举复杂度O(n)，二分复杂度O(logn)，ST求最大最小值复杂度O(logn)，总时间复杂度为O(n(logn)^2)。

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
         #include 
         #include 
         
           #include 
          
            #include 
           
             #include 
            
              #include 
             
               #include 
              
                #include 
               
                 #include 
                
                  #include 
                 
                   #include 
                  
                    #define mp make_pair #define X first #define Y second #define MEMSET(a, b) memset(a, b, sizeof(a)) using namespace std; typedef unsigned int ui; typedef long long ll; typedef unsigned long long ull; typedef pair 
                   
                     pii; typedef vector 
                    
                      vi; typedef vi::iterator vi_it; typedef map 
                     
                       mii; typedef priority_queue 
                      
                        pqi; typedef priority_queue 
                       
                         , greater 
                        
                          > rpqi; typedef priority_queue 
                         
                           pqp; typedef priority_queue 
                          
                            , greater 
                           
                             > rpqp; const int MAX_N = 100000 + 2; const int INF = (int)1.0e9; pii drop[MAX_N]; int dp[MAX_N][18][2]; void make_rmq(int n) { int i, j; for (i = 0; i < n; ++i) { dp[i][0][0] = drop[i].Y; dp[i][0][1] = drop[i].Y; } for (j = 1; (1 << j) <= n; ++j) { for (i = 0; i + (1 << j) <= n; ++i) { dp[i][j][0] = max(dp[i][j - 1][0], dp[i + (1 << (j - 1))][j - 1][0]); dp[i][j][1] = min(dp[i][j - 1][1], dp[i + (1 << (j - 1))][j - 1][1]); } } } int rmq_max(int s, int t) { int k = (int)(log((double)(t - s + 1)) / log(2.0)); return max(dp[s][k][0], dp[t - (1 << k) + 1][k][0]); } int rmq_min(int s, int t) { int k = (int)(log((double)(t - s + 1)) / log(2.0)); return min(dp[s][k][1], dp[t - (1 << k) + 1][k][1]); } int main(int argc, char *argv[]) { // freopen("D:\\in.txt", "r", stdin); int n, d, i; cin >> n >> d; for (i = 0; i < n; ++i) { scanf("%d%d", &drop[i].X, &drop[i].Y); } sort(drop, drop + n); make_rmq(n); int ans = INF; for (i = 1; i < n; ++i) { if (rmq_max(0, i) - rmq_min(0, i) < d) { continue; } int low = 0, high = i - 1, mid; while (low < high && drop[i].X - drop[high].X < ans) { mid = (low + high + 1) >> 1; if (rmq_max(mid, i) - rmq_min(mid, i) >= d) { low = mid; } else { high = mid - 1; } } ans = min(ans, drop[i].X - drop[low].X); } printf("%d\n", ans == INF ? -1 : ans); return 0; }