zoukankan      html  css  js  c++  java
  • 三分

    整数

    //三分极小值 
    int Left, Right;
    int mid, midmid;
    int mid_value, midmid_value;
    Left = minn; Right = maxn;
    while (Right - Left > 5)
    {
        mid = (Left + Right) / 2;
         midmid = (mid + Right) / 2;
          mid_value = Cal(mid);
           midmid_value = Cal(midmid);
        if (mid_value >= midmid_value) Left = mid;
        else Right = midmid;
    }
    int ans=Cal(Left) ;
    for(int i=Left+1 ;i<=Right ;i++)
        ans=min(ans,Cal(i)) ;
    printf("%d
    ",ans) ;
    
    //三分极大值 
    int Left, Right;
    int mid, midmid;
    int mid_value, midmid_value;
    Left = minn; Right = maxn;
    while (Right - Left > 5)
    {
        mid = (Left + Right) / 2;
         midmid = (mid + Right) / 2;
          mid_value = Cal(mid);
           midmid_value = Cal(midmid);
        if (mid_value >= midmid_value) Right = midmid;
        else Left = mid;
    }
    int ans=Cal(Left) ;
    for(int i=Left+1 ;i<=Right ;i++)
        ans=max(ans,Cal(i)) ;
    printf("%d
    ",ans) ;
    View Code
  • 相关阅读:
    FileWatcher
    virtual table(有180个评论)
    this 指针
    docker -ce(社区免费版)
    vue-cli
    CAP理论、BASE理论
    B+树和LSM存储引擎代表树和B-树
    CPU高速缓存
    Python&基础环境搭建
    二叉树
  • 原文地址:https://www.cnblogs.com/xiaohongmao/p/3769114.html
Copyright © 2011-2022 走看看