A:枚举前两位,等差数列就确定了
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ls (o<<1)
#define rs (o<<1|1)
#define pb push_back
const double PI= acos(-1.0);
const int M = 1e5+7;
/*
int head[M],cnt=1;
void init(){cnt=1,memset(head,0,sizeof(head));}
struct EDGE{int to,nxt,w;}ee[M*2];
void add(int x,int y,int w){ee[++cnt].nxt=head[x],ee[cnt].w=w,ee[cnt].to=y,head[x]=cnt;}
*/
long long a[100007];
long long c[100007];
int ck(int x,int y,int n)
{
a[0]+=x;a[1]+=y;
int d=a[1]-a[0];
for(int i=2;i<n;i++)a[i]=a[i-1]+d;
bool f=true;int nm=0;
int mi=n+7;
for(int i=2;i<=n;i++)
{
if(abs(c[i]-a[i])>1)f=false;
else if(c[i]==a[i]);
else nm++;
}
if(x!=0)nm++;if(y!=0)nm++;
if(f)mi=min(nm,mi);
a[0]-=x;a[1]-=y;
return mi;
}
int solve(int n, vector<int>& b) {
// write code here
for(int i=0;i<n;i++)c[i]=b[i],a[i]=b[i];
int mi=n+7,d;
mi=min(mi,ck(1,1,n));
mi=min(mi,ck(1,0,n));
mi=min(mi,ck(1,-1,n));
mi=min(mi,ck(0,1,n));
mi=min(mi,ck(0,-1,n));
mi=min(mi,ck(0,0,n));
mi=min(mi,ck(-1,1,n));
mi=min(mi,ck(-1,0,n));
mi=min(mi,ck(-1,-1,n));
if(mi==n+7)mi=-1;
return mi;
}
/*
4
24 21 14 10
*/
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n,x;
vector<int>b;
cin>>n;
for(int i=1;i<=n;i++)cin>>x,b.pb(x);
cout<<solve(n,b);
return 0;
}
B:
一定是最长路径+其余边的2倍
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ls (o<<1)
#define rs (o<<1|1)
#define pb push_back
const double PI= acos(-1.0);
const int M = 1e5+7;
int head[M],cnt=1;
void init(){cnt=1,memset(head,0,sizeof(head));}
struct EDGE{int to,nxt,w;}ee[M*2];
void add(int x,int y,int w){ee[++cnt].nxt=head[x],ee[cnt].w=w,ee[cnt].to=y,head[x]=cnt;}
struct Point{
int x,y;
};
ll dp[100007],ans=0;
void dfs(int x,int fa){
ll ma=0;
for(int i=head[x];i;i=ee[i].nxt){
int y=ee[i].to,w=ee[i].w;
if(y==fa)continue;
dfs(y,x);
//ans=max(ans,ma+dp[y]+val[i]);
//ma=max(ma,dp[y]+val[i]);
ans=max(ans,dp[x]+dp[y]+w);//经过x的加上经过y的,还有x,y之间的边
dp[x]=max(dp[x],dp[y]+w);
}
//dp[x]=ma;
}
long long solve(int n, vector<Point>& e, vector<int>& w) {
// write code here
memset(dp,0,sizeof(dp));
ans=0;
long long sm=0;
for(int i=0;i<n-1;i++)
{
sm+=w[i];
// cout<<"-- "<<w[i]<<" "<<sm<<endl;
int u=e[i].x,v=e[i].y;
add(u,v,w[i]);
add(v,u,w[i]);
}
dfs(1,-1);
//cout<<sm<<" "<<ans<<endl;
return (sm-ans)*2+ans;
}
/*
5
1 2
2 3
3 4
2 5
39 48 54 100
*/
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n,x;
vector<int>v;
vector<Point>e;
cin>>n;
for(int i=1;i<n;i++)
{
int y;
cin>>x>>y;
e.pb(Point{x,y});
}
for(int i=1;i<n;i++)cin>>x,v.pb(x);
cout<<solve(n,e,v);
return 0;
}
C:
启发式分治简单题。
但这题更简单的做法是直接枚举哪一个值做为最大值[单调栈维护边界],然后二分查找两边第一个比他小的,且二倍小于它的数。
粘贴下启发式分治的做法:
#include <bits/stdc++.h>
using namespace std;
const int M = 1e5+7;
typedef long long ll;
ll dp[M][23][2];
int lg[M],a[M];
void RMQ(int n)
{
lg[0]=-1;for(int i=1;i<M;i++)lg[i]=lg[i>>1]+1;
for(int i=1;i<=n;i++)
dp[i][0][0]=a[i];
for(int j=1;(1<<j)<=n;j++)
for(int i=1;i+(1<<j)-1<=n;i++)
dp[i][j][0]=min(dp[i][j-1][0],dp[i+(1<<j-1)][j-1][0]);
for(int i=1;i<=n;i++)
dp[i][0][1]=i;//左端点i,区间长度2^0
for(int j=1;(1<<j)<=n;j++)//区间长度
for(int i=1;i+(1<<j)-1<=n;i++)
{
dp[i][j][1]=a[dp[i][j-1][1]]>=a[dp[i+(1<<j-1)][j-1][1]]?
dp[i][j-1][1]:dp[i+(1<<j-1)][j-1][1];//RMQ问题可以区间重叠
}
}
int qu(int l,int r,int z)
{
int k=lg[r-l+1];
if(z==0)return min(dp[l][k][z],dp[r-(1<<k)+1][k][z]);
k=0;
while(1<<k+1<=r-l+1)
k++;
return (a[dp[l][k][1]]>=a[dp[r-(1<<k)+1][k][1]]?dp[l][k][1]:dp[r-(1<<k)+1][k][1]);
}
ll ans;
void cal(int L,int R)
{
if(L>=R)return;
int pos=qu(L,R,1);
if(pos-L<=R-pos)
{
for(int i=L;i<=pos;i++)
{
int l=pos,r=R,now=R+1;
while(l<=r)
{
int mid=(l+r)/2;
if(2*qu(i,mid,0)<=a[pos])
{
r=mid-1;
now=mid;
}
else l=mid+1;
}
ans+=R-now+1;
}
}
else
{
for(int i=R;i>=pos;i--)
{
int l=L,r=pos,now=L-1;
while(l<=r)
{
int mid=(l+r)/2;
if(2*qu(mid,i,0)<=a[pos])
{
l=mid+1;
now=mid;
}
else r=mid-1;
}
ans+=now-L+1;
}
}
cal(L,pos-1);
cal(pos+1,R);
}
long long MaxMin(int* ar, int n) {
// write code here
for(int i=1;i<=n;i++)a[i]=ar[i-1];
RMQ(n);
ans=0;
cal(1,n);
return ans;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int b[M];
int n;
cin>>n;
for(int i=0;i<n;i++)cin>>b[i];
cout<<MaxMin(b,n);
return 0;
}