[NOIp复习计划]:二分答案

[bzoj 1614] [Usaco2007 Jan]Telephone Lines架设电话线
二分答案，把小于k的设成0否则为1，然后spfa判断。

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 20005;
int h[MAXN],to[MAXN<<1],nx[MAXN<<1],v[MAXN<<1],tot;
int n,p,k,v2[MAXN<<1],d[MAXN];
int q[MAXN<<2],l,r;
bool inq[MAXN];
void ins(int a,int b,int c){
    to[++tot]=b;
    v[tot]=c;
    nx[tot]=h[a];
    h[a]=tot;
}
int spfa(int x){
    for(int i=1;i<=tot;i++){
        if(v[i] <= x){
            v2[i]=0;
        }else{
            v2[i]=1;
        }
    }
    l=r=0;
    memset(d,0x3f,sizeof d);
    q[r++]=1;d[1]=0;inq[1]=1;
    while(l!=r){
        int t=q[l++];if(l==MAXN)l=0;
        for(int i=h[t];i;i=nx[i]){
            if(d[to[i]] > d[t] + v2[i]){
                d[to[i]]=d[t]+v2[i];
                if(inq[to[i]]==0){
                    inq[to[i]]=1;
                    q[r++]=to[i];
                    if(r==MAXN)r=0;
                }
            }
        }
        inq[t]=0;
    }
    if(d[n]==0x3f3f3f3f){return -1;}
    return d[n]<=k;
}
int main(){
    scanf("%d %d %d",&n,&p,&k);
    for(int i=1;i<=p;i++){
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        ins(a,b,c);ins(b,a,c);
    }
    int l=0,r=0x3f3f3f3f,ans=0;
    while(l<=r){
        int mid = l+r>>1;
        int rt=spfa(mid);
        if(rt==1){
            ans=mid;
            r=mid-1;
        }else if(rt==0){
            l=mid+1;
        }else{
            printf("-1");
            return 0;
        }
    }
    printf("%d",ans);
    return 0;
} 

[luogu 1850]借教室
二分答案，然后用差分数列维护区间加减，检验是否有负数O(n),总复杂度O(nlgm)

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1000006;
typedef long long ll;
int read(){
    int rt=0,fl=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')fl=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){rt=rt*10+ch-'0';ch=getchar();}
    return rt*fl;
}
int n,m,data[MAXN];
struct person{
    int l,r,v;
}data2[MAXN];
ll divid[MAXN];
bool check(){
    ll buf=0,now;
    for(int i=1;i<=n;i++){
        buf += divid[i];
        now = buf + data[i];
        if(now<0)return 1;
    }
    return 0;
}
int main(){
    n=read();m=read();
    for(int i=1;i<=n;i++)data[i]=read();
    for(int i=1;i<=m;i++){
        data2[i].v=read();data2[i].l=read();data2[i].r=read();
    }
    int l=1,r=m,pr=0,ans=0;
    while(l<=r){
        int mid = l+r>>1;
        while(pr<mid){
            pr++;
            divid[data2[pr].l]-=data2[pr].v;
            divid[data2[pr].r+1]+=data2[pr].v;
        }while(pr<mid);
        while(pr>mid){
            divid[data2[pr].l]+=data2[pr].v;
            divid[data2[pr].r+1]-=data2[pr].v;
            pr--;
        }
        if(check()){
            ans=mid;
            r=mid-1;
        }else{
            l=mid+1;
        }
    }
    if(ans==0)puts("0");
    else printf("-1\n%d",ans);
    return 0;
}

[bzoj 3695]滑行
根据费马原理，延光的折射的路线时间最短，这样我们可以二分最开始的角度，根据折射定律计算每次跨越矩形的角度，注意折射角的定义。
折射定律
$sin α : v_α = sin β : v_β$

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 150;
const double eps = 1e-12;
const double pi = acos(-1);
double h[MAXN],v[MAXN];
int n,x;
double ans,buf;
bool check(double alphi){
    double ret=0,sum=0;
    for(int i=1;i<=n;i++){
        sum += h[i] / tan(alphi);
        ret += h[i] / sin(alphi) / v[i];
        alphi = pi/2-asin(sin(pi/2-alphi)*v[i+1]/v[i]);
    }   
//  cout<<ret<<" "<<sum<<endl;
    buf = ret;
    return sum<=x;
}
int main(){
    scanf("%d %d",&n,&x);
    for(int i=1;i<=n;i++)scanf("%lf",h+i);
    for(int i=1;i<=n;i++)scanf("%lf",v+i);
    double l=0,r=pi/2;
    while(r-l>eps){
        double mid = (l+r)/2;
        if(check(mid)){
            ans=mid;
            r=mid;
        }else{
            l=mid;
        }
    }
    printf("%.3lf",buf);
    return 0;
} 


[bzoj 1699][Usaco2006 Oct]Hungry Cows饥饿的奶牛
裸题，没啥好说的

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 5005;
int n,data[MAXN],ans2,arr[MAXN],maxval=0;
int find(int l,int r,int val){
    if(arr[maxval]<val){return maxval+1;}
    int ans=0;
    while(l<=r){
        int mid=l+r>>1;
        if(arr[mid]>=val){
            ans=mid;
            r=mid-1;
        }else{
            l=mid+1;
        }
    }
    return ans;
}
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",&data[i]);
    for(int i=1;i<=n;i++){
        int loc=find(1,maxval,data[i]);
        maxval=max(maxval,loc);
        ans2 = max(ans2,loc);
        arr[loc]=data[i];
    }
    printf("%d",ans2);
    return 0;
}

to be continued……