二分练习
最大化最小值
POJ3258
POJ3258
我真的是写bug能手，二分说崩就崩调了好久最后还是面向题解。。
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
const int N = 5e4 + 5;
const int inf = 0x3f3f3f3f;
int L,n,m;
int dis[N],tmp[N];
bool judge(int x)
{
int cur = 0, cnt = 0;
for(int i = 1; i <= n ; i++)
{
if(dis[i] - cur < x)
cnt++;
else
cur = dis[i];
}
if(L - cur < x) return false;//最后一跳必须要有
if (cnt > m) return false;
return true;
}
int main()
{
cin >> L >> n >> m;
//cout << L <<" "<< n <<" "<< m<<endl;
for( int i = 1; i <= n ; i++)
{
cin >> dis[i];
}
sort(dis, dis + n + 1);
dis[0] = 0;
//for (int i = 0; i <= n ;i++){ cout<<dis[i]<<" "; }
int r = L , l = 0;
int ans;
//cout << l << " " << r <<endl;
while (r >= l )
{
int mid = (l + r) / 2;
//cout << l << " " << r << " " << mid << endl;
if (judge(mid)) {
l = mid + 1;
ans = mid;
} else {
r = mid - 1;
}
}
//cout <<"ans : "<< l << r<< endl;
printf("%d", ans);
}
POJ3273
POJ3273
发现了比较好用的二分框架 然后这道题就随便水过去了
O(nlog1e9)的复杂度跑了340ms，n是1e5，二分也太强大了
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
const int inf = 99999;
int n, m;
int cst[N];
bool judge(ll mid)
{
int cnt = 1;
ll sum =0;
for(int i = 0; i < n ; i++)
{
if( cst[i] > mid) return false;
if (sum + cst[i] > mid)
{
//cout << sum <<" "<< cnt << endl;
cnt++;
sum = 0;
}
sum += cst[i];
}
//cout << cnt << endl;
if ( cnt > m ) return false;
return true;
}
int main()
{
cin >> n >> m;
int l = 0, r = 1e9 + 5, mid, ans;
for (int i = 0; i < n ;i++)
{
cin >> cst[i];
}
while(r >= l )
{
mid = (r + l) /2;
//cout << l <<" "<< r <<" "<< mid << endl;
if(judge(mid))
{
//cout<<"A";
r = mid - 1;
ans = mid;//这样二分要求mid是满足条件的
}
else
{ //cout<<"B";
l = mid + 1;
}
}
cout << ans << endl;
}
POJ3104
POJ3104 晾衣服
这题wa了好几发，各种各样的奇怪原因
1
1
1 向上取整数要手打，ceil会出错
2
2
2 题意理解 吹风机吹干5滴水的同时衣服不会自然风干，所以一分钟其实只能加快4滴水，于是吹风机能吹1滴水的时候相当于没有吹风机。二分答案时也应该计算“吹风机能加速的水滴数”而不是“吹风机吹干的水滴”
3
3
3输入输出，
c
i
n
c
o
u
t
cincout
cincout又被卡了，
s
c
a
n
f
scanf
scanf又可以了，是不是poj的尿性
4
4
4二分的边界，过大了爆
l
o
n
g
l
o
n
g
long\ long
long long
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
const int N=1e5+5;
//ll Ans;
int a[N];
int n,k;
bool check(ll x){
ll sum=0,ans =0;
for(int i=0;i<n;i++){
if(a[i]>x){
ll tmp =(a[i]-x)%k? (a[i]-x)/k+1:(a[i]-x)/k;
sum+=tmp;
ans=max(ans,(ll)a[i]-tmp*k);
if(sum>x) return false;
}
else ans=max(ans,(ll)a[i]);
}
ans=max(sum,ans);
if(ans>x) return false;
else {
return true;
}
}
signed main()
{
scanf("%lld",&n);
int mn=0;
for(int i=0;i<n;i++){
scanf("%lld",&a[i]);
mn=max(mn,a[i]);
}
scanf("%lld",&k);
//cin>>k;
k--;//题意之坑
if(k==0){
cout<<mn;
}
else{
ll l=0,r=1e9+5,mid,ans;
while(r>=l){
mid=(r+l)/2;
//cout<<"lrans"<<l<<" "<<r<<" "<<mid<<" "<<ans<<endl;
if(check(mid)){
r=mid-1;
ans=mid;
}
else l=mid+1;
}
//cout<<"lrans"<<l<<" "<<r<<" "<<ans<<endl;
printf("%lld",ans);
}
return 0;
}
POJ3104
POJ3104叠罗牛
贪心可写。
一开始觉得按
w
[
i
]
+
s
[
i
]
w[i]+s[i]
w[i]+s[i]排序，然后取
Σ
w
−
w
[
0
]
−
s
[
0
]
\Sigma{w}-w[0]-s[0]
Σw−w[0]−s[0]就是答案，因为s和w都是正的。然而很容易找到反例
1 1
100 2
100 101
此时最下面的
r
i
s
k
=
0
risk=0
risk=0，倒数第二个的
r
i
s
k
=
−
1
risk=-1
risk=−1
所以要遍历一遍，找到最小的
r
i
s
k
risk
risk
POJ Run ID 22224646
最大化平均值
POJ2976
1wa贼傻逼，看漏了输入0 0结束
是一道经典平均值题目，二分答案后贪心
注意四舍五入的简单写法
printf("%d\n",(int)((l+r)/2+0.5));
虽然我那样打也没事，但是丑
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
typedef long long ll;
const int N=1005;
ll k,n;
ll w[N],v[N];
double y[N];
bool C(double x){
for(int i=0;i<n;i++){
y[i]=(double)(v[i]-x*w[i]);
}
sort(y,y+n);
double sum=0;
for(int i=0;i<k;i++){
sum+=y[n-i-1];
}
return sum>=0;
}
void solve(){
double l=0,r=1;
for(int i=0;i<100;i++){
double mid=(l+r)/2.0;
if(C(mid)) l=mid;
else r=mid;
}
int a1=l*100,a2=a1+1;
int ans = fabs(l*100.0-a1)>fabs(l*100.0-a2)?a2:a1;
cout<<ans<<endl;
/*
or
l*=100,r*=100;
printf("%d\n",(int)((l+r)/2+0.5));
*/
}
int main(){
while(cin>>n>>k&&n+k!=0){
k=n-k;
for(int i=0;i<n;i++) cin>>v[i];
for(int i=0;i<n;i++) cin>>w[i];
solve();
}
}
POJ3111
注意二分边界，不一定是1
以及二分100次tle时要换成
w
h
i
l
e
(
f
a
b
s
(
l
−
r
)
>
1
e
−
6
)
while(fabs(l-r)>1e^{-6})
while(fabs(l−r)>1e−6)
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
const int N=1e5+5;
int v[N],w[N];
double y[N];
int n,k;
struct jewel{
int id;
double y;
}jw[N];
bool cmp(jewel a,jewel b){
return a.y<b.y;
}
double calc(double x){
for(int i=0;i<n;i++){
jw[i].y=(double)(v[i]-x*w[i]);
jw[i].id=i+1;
}
sort(jw,jw+n,cmp);
double sum=0;
//cout<<"y"<<endl;
for(int i=0;i<k;i++){
sum+=jw[n-i-1].y;
//cout<<jw[n-i-1].y<<" ";
}
return sum>=0;
}
void solve(){
double l=0,r=1e306+5;
while(fabs(l-r)>1e-6){
double mid=(l+r)/2.0;
if(calc(mid)) l=mid;
else r=mid;
}
//cout<<l<<endl;
printf("%d",jw[n-1].id);
for(int i=1;i<k;i++){
printf(" %d",jw[n-i-1].id);
}
printf("\n");
}
int main(){
//cin>>n>>k;
scanf("%d%d",&n,&k);
for(int i=0;i<n;i++) scanf("%d%d",&v[i],&w[i]);//cin>>v[i]>>w[i];
solve();
}
查找第K大的值
POJ3579
查找中位数
这道题居然卡
l
o
n
g
l
o
n
g
long\ long
long long???改
i
n
t
int
int后922ms卡过orz
我爪巴了，机房的大佬说可以双指针线性过wtcl
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
typedef long long ll;
const int N=1e5+5;
int n,a[N];
ll cnt;
bool check(int x){
ll sum=0;
for (int i=0;i<n;i++){
int pos=lower_bound(a,a+n,x+a[i])-a;
sum+=(pos-i-1)>0? pos-i-1:0;
}
if(sum>=cnt) return false;
else return true;
}
int main()
{
while(~scanf("%d",&n)){
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
sort(a,a+n);
ll tmp=(n-1)*n/2;
if(tmp&1) cnt=tmp/2+1;
else cnt=tmp/2;
int l=0,r=1e9+5,mid,ans;
while(l<=r){
mid=(l+r)/2;
if(check(mid)){
l=mid+1;
ans=mid;
}
else r=mid-1;
}
printf("%d\n",ans);
}
}
POJ 3685
在n*n矩阵中查找第m小的值
查了一下午居然是因为在一个小函数里忘了把int改longlong！差点当场气死orz
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#define INF
using namespace std;
typedef long long ll;
const int N=1e5+5;
const int del=100000;
ll n,m;
ll cal(ll i,ll j){
return i*i+del*i+j*j-del*j+i*j;
}
bool check(ll x){
ll cnt=0;
for(int j=1;j<=n;j++){
ll sl=1,sr=n;
int ant=0;
while(sl<=sr)
{
ll smid=(sl+sr)>>1;
if(cal(smid,j)<=x)
{
ant=smid;
sl=smid+1;
}
else sr=smid-1;
}
cnt+=ant;
//cout<<l<<" ";
}
//cout<<endl<<cnt<<endl;
//cout<<"cmp: "<<cnt<<" "<<m<<endl;
if(cnt==m) return false;
if(cnt<m) return true;
else return false;
//return cnt>m;
}
int main()
{
int t;
scanf("%d",&t);
while(t--){
scanf("%d%d",&n,&m);
ll l=-del*n,r=n*n+del*n+n*n+n*n,ans,mid;//偷懒一下
while(l<=r){
mid=(l+r)/2;
if(check(mid)){
l=mid+1;
}else{
r=mid-1;
ans=mid;
}
}
printf("%lld\n",ans);
}
}
其他
POJ1759
一条链不落地
二分第二个点的值。其实只要第二个点确定了这条链就是确定好了的。相当于后面的点都在验证这种情况符不符合要求
1wa，因为输出了-0.00(这太怪了
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#define eps 1e-10
using namespace std;
typedef long long ll;
const int N=1e3+5;
int n,a[N],pos;
double h[N];
bool check(double x){
// cout;
h[2]=x;
//cout<<endl<<h[1]<<" "<<h[2]<<" ";
for(int i=3;i<=n;i++) {
h[i]=2*(h[i-1]+1)-h[i-2];
//cout<<h[i]<<" ";
if(h[i]<0) return false;
}
return true;
}
int main(){
cin>>n>>h[1];
//pos= n&1? n/2+1:n/2;
double l=-1e6,r=1e6,mid,ans;
while(r-l>1e-9){
mid=(l+r)/2;
//cout<<endl<<l<<" "<<r<<" "<<mid<<endl;
if(check(mid)){
r=mid;
}else l=mid;
}
//h[n]=fabs(h[n]);
printf("%.2f",h[n]);
//cout<<h[n];
}
POJ 3484
查找前缀和
这道题真的是十分的奇怪，这个输入输出就很奇怪就很阴间。最后的答案还是二分前缀和。
因为是等差数列，所以这个数列中mid之前的数出现了多少次都可以
O
(
1
)
O(1)
O(1)得出，所以二分答案。出现次数为奇数的数前每个数出现次数的前缀和都是偶数，之后的每个数出现的都是奇数。
“没有单调性怎么二分，只能二分k”
还可以构造！想不到吧
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<map>
#include<cmath>
#include<sstream>
#define eps 1e-10
using namespace std;
typedef long long ll;
#define int ll
const int N = 2e5 + 5;
char s[N];
int tot = 0;
struct seg
{
ll x, y, z;
} a[N];
bool check(ll mid)
{
ll sum = 0;
for(int i = 0; i < tot; i++)
{
if(mid >= a[i].x)
{
sum += (min(mid,a[i].y) - a[i].x) / a[i].z+1;
}
}
return sum & 1;
}
ll calc(ll mid){
ll sum=0;
for(int i=0;i<tot;i++){
if(mid >= a[i].x)
{
sum += (min(mid,a[i].y) - a[i].x) / a[i].z+1;
}
}
return sum;
}
void solve()
{
// for(int i = 0; i < tot; i++)
// cout << a[i].x << " " << a[i].y << " " << a[i].z << endl;
long long suf = 1e11+5, inf = 1, mid, ans=-1;
while(inf <= suf)
{
mid = (inf + suf) / 2;
if(check(mid))
{
ans = mid;
suf = mid - 1;
}
else
inf = mid + 1;
}
if(ans == -1)
puts("no corruption");
else
printf("%lld %lld\n",ans,calc(ans)-calc(ans-1));
}
signed main()
{
while (gets(s))
{
//cout<<s<<endl;
//cout<<(int)s[0]<<endl;
if(strlen(s))
{
int x, y, z;
stringstream ss;
string sss(s);
ss << sss;
//cout <<sss;
ss >> a[tot].x >> a[tot].y >> a[tot].z;
//cout <<"sss"<< a[tot].x << a[tot].y << a[tot].z<<"***"<<endl;
tot++;
}
else
{
if(tot>0){
solve();
tot = 0;
}
else
continue;
}
}
solve();
}
二分终于打完辽，撒花~
扫一扫
5236
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
