1.题目描述:
2.题意:
略。
3.思路:
1)纯暴力。 双重循环,T飞警告!
部分代码:
int n,m;
int a[maxn];
li void solve()
{
a[0]=read();
rep(i,1,n)
{
a[i]=read();
int ind=0,minv=abs(a[i]-a[0]),mina=a[0];
rep(j,1,i)
{
int tmp=abs(a[j]-a[i]);
if(tmp<minv)
{
minv=tmp;
ind=j;
mina=a[j];
}
else if(tmp==minv)
{
if(a[j]<mina)
{
mina=a[j];
ind=j;
}
}
}
write(minv,' ');write(ind+1);
}
//puts("");
}
int main()
{
//srand(time(0));debug();
//clock_t start_time=clock();
//freopen("C:\\Users\\Administrator\\Desktop\\in.txt","r",stdin);
//for(int QwQ=read();QwQ;QwQ--) solve();
while(~scanf("%d",&n)) solve();
//cerr<<"Time:"<<clock()-start_time<<"ms\n";
return 0;
}
2)平衡树剪枝暴力。 【正解】 用set把离它最近的两个值找出来,然后选较小的那个。智慧暴力赛高!!【本质是找前驱和后继】
//AcWing 136. 邻值查找
//#include<bits/stdc++.h>
//#pragma GCC optimize(3,"Ofast","inline")
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
//#include<random>
#include<cstdlib>
#include<ctime>
#include<fstream>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define FAST ios::sync_with_stdio(false)
#define DEV_RND ((int)rand()*RAND_MAX+rand())
#define RND(L,R) (DEV_RND%((R)-(L)+1)+(L))
#define abs(a) ((a)>=0?(a):-(a))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mem(a,b) memset(a,b,sizeof(a))
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define rep(i,a,n) for(int i=a;i<n;++i)
#define repn(i,a,n,t) for(int i=a;i<n;i+=t)
#define per(i,n,a) for(int i=n-1;i>=a;--i)
#define pern(i,n,a,t) for(int i=n-1;i>=a;i-=t)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define li inline
#define re register
using namespace std;
//typedef uniform_int_distribution<int> RNDI;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef double db;
typedef long long ll;
typedef long double ld;
const int maxn = 1e5+5;
const int maxm = 100000+5;
const int inf=0x3f3f3f3f;
const double eps = 1e-9;
const double pi=acos(-1);
const int mod = 1e9+7;
//int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
//li int f(int x){return x==par[x]?par[x]:par[x]=f(par[x]);}
//mt19937 eng(time(0));
li ll lowbit(ll x){return x&(-x);}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
//li int RND(int L,int R){RNDI rnd(L,R);return rnd(eng);}
void ex_gcd(ll a,ll b,ll &d,ll &x,ll &y){if(!b){d=a,x=1,y=0;}else{ex_gcd(b,a%b,d,y,x);y-=x*(a/b);}}//x=(x%(b/d)+(b/d))%(b/d);
li ll qpow(ll a,ll b,ll MOD=mod){ll res=1;a%=MOD;while(b>0){if(b&1)res=res*a%MOD;a=a*a%MOD;b>>=1;}return res%MOD;}
li ll qmul(ll a,ll b,ll MOD=mod){return (a*b-(ll)((long double)a/MOD*b)*MOD+MOD)%MOD;}
li ll Qpow(ll a,ll b,ll MOD){ll res=1;while(b>0){if(b&1) res=qmul(res,a,MOD);a=qmul(a,a,MOD);b>>=1;}return res%MOD;}
li ll invp(ll x,ll p){return qpow(x,p-2,p);}
ll invd(ll x,ll p){ll res,d,t;ex_gcd(x,p,d,res,t);return res;}
li ll Jos(ll n,ll k,ll s=1){ll res=0;rep(i,1,n+1) res=(res+k)%i;return (res+s)%n;}
namespace IO
{
li int read()
{
int x=0,sign=1;char c=getchar();
while(c>'9'||c<'0') {if(c=='-') sign=-1;c=getchar();}
while('0'<=c&&c<='9') x=x*10+c-'0',c=getchar();
return x*sign;
}
template<typename T>
li void write(T x,char t='\n')
{
if(x<0){x=-x;putchar('-');};
static int sta[25];int top=0;
do{sta[top++]=x%10,x/=10;}while(x);
while(top) putchar(sta[--top]+'0');
putchar(t);
}
}
using namespace IO;
/*-------------head-------------*/
//
int n,x,cnt;
set<PII> s;
li void solve()
{
s.insert(mp(read(),++cnt));
rep(i,1,n)
{
x=read();
auto min_pos=s.lower_bound(mp(x,0));
if(min_pos!=s.begin()) min_pos--;
auto max_pos=s.upper_bound(mp(x,0));
int res=inf,pos=0;
if(max_pos!=s.end()) res=abs(x-max_pos->fi),pos=max_pos->se;
if(abs(x-min_pos->fi)<=res) res=abs(x-min_pos->fi),pos=min_pos->se;
write(res,' ');write(pos);
s.insert(mp(x,++cnt));
}
//puts("");
}
int main()
{
//srand(time(0));debug();
//clock_t start_time=clock();
//freopen("C:\\Users\\Administrator\\Desktop\\in.txt","r",stdin);
//for(int QwQ=read();QwQ;QwQ--) solve();
while(~scanf("%d",&n)) solve();
//cerr<<"Time:"<<clock()-start_time<<"ms\n";
return 0;
}
3)离线+链表【正解】。(这个方法我是没想过的,离线算法真的厉害!)这个本身是一个在线问题,但是我们可以转化成离线来解决。由于本质就是求最接近一个数字的前后两个数字,那么我们可以先排序,排完序之后的前后两个数字去min就是答案啦!但是由于这题本身是在线的,所以我们还要记录下它原本的位置。而且这题的A是各不相同,就比较nice!我们排序,从后往前找答案,(因为在线是从前往后嘛),找到答案后,记录下来,然后删除当前节点。
算法思路:
1)读入数组并记录位置。
2)排序。
3)记录在链表中的位置,以及前驱后继的位置。
4)求最小值,记录答案。
5)删除节点。
6)倒序输出。
4.代码:
(数组模拟链表要好做不少。【list它不香了QwQ】)
//AcWing 136. 邻值查找
//#include<bits/stdc++.h>
//#pragma GCC optimize(3,"Ofast","inline")
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<list>
//#include<random>
#include<cstdlib>
#include<ctime>
#include<fstream>
#include<map>
#include<stack>
#include<queue>
#define FAST ios::sync_with_stdio(false)
#define DEV_RND ((int)rand()*RAND_MAX+rand())
#define RND(L,R) (DEV_RND%((R)-(L)+1)+(L))
#define abs(a) ((a)>=0?(a):-(a))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mem(a,b) memset(a,b,sizeof(a))
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define rep(i,a,n) for(int i=a;i<n;++i)
#define repn(i,a,n,t) for(int i=a;i<n;i+=t)
#define per(i,n,a) for(int i=n-1;i>=a;--i)
#define pern(i,n,a,t) for(int i=n-1;i>=a;i-=t)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define li inline
#define re register
using namespace std;
//typedef uniform_int_distribution<int> RNDI;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef double db;
typedef long long ll;
typedef long double ld;
const int maxn = 1e5+5;
const int maxm = 100000+5;
const int inf=0x3f3f3f3f;
const double eps = 1e-9;
const double pi=acos(-1);
const int mod = 1e9+7;
//int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
//li int f(int x){return x==par[x]?par[x]:par[x]=f(par[x]);}
//mt19937 eng(time(0));
li ll lowbit(ll x){return x&(-x);}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
//li int RND(int L,int R){RNDI rnd(L,R);return rnd(eng);}
void ex_gcd(ll a,ll b,ll &d,ll &x,ll &y){if(!b){d=a,x=1,y=0;}else{ex_gcd(b,a%b,d,y,x);y-=x*(a/b);}}//x=(x%(b/d)+(b/d))%(b/d);
li ll qpow(ll a,ll b,ll MOD=mod){ll res=1;a%=MOD;while(b>0){if(b&1)res=res*a%MOD;a=a*a%MOD;b>>=1;}return res%MOD;}
li ll qmul(ll a,ll b,ll MOD=mod){return (a*b-(ll)((long double)a/MOD*b)*MOD+MOD)%MOD;}
li ll Qpow(ll a,ll b,ll MOD){ll res=1;while(b>0){if(b&1) res=qmul(res,a,MOD);a=qmul(a,a,MOD);b>>=1;}return res%MOD;}
li ll invp(ll x,ll p){return qpow(x,p-2,p);}
ll invd(ll x,ll p){ll res,d,t;ex_gcd(x,p,d,res,t);return res;}
li ll Jos(ll n,ll k,ll s=1){ll res=0;rep(i,1,n+1) res=(res+k)%i;return (res+s)%n;}
li void debug(){ofstream fout("C:\\Users\\Administrator\\Desktop\\in.txt");fout.close();}
namespace IO
{
li int read()
{
int x=0,sign=1;char c=getchar();
while(c>'9'||c<'0') {if(c=='-') sign=-1;c=getchar();}
while('0'<=c&&c<='9') x=x*10+c-'0',c=getchar();
return x*sign;
}
template<typename T>
li void write(T x,char t='\n')
{
if(x<0){x=-x;putchar('-');};
static int sta[25];int top=0;
do{sta[top++]=x%10,x/=10;}while(x);
while(top) putchar(sta[--top]+'0');
putchar(t);
}
}
using namespace IO;
/*-------------head-------------*/
//
int n,m;
int l[maxn],r[maxn],pos[maxn];
PII a[maxn],ans[maxn];
li void solve()
{
rep(i,1,n+1) a[i].fi=read(),a[i].se=i;
sort(a+1,a+n+1);a[0]=mp(-inf,0),a[n+1]=mp(inf,0);
rep(i,1,n+1)
{
l[i]=i-1,r[i]=i+1;
pos[a[i].se]=i;
}
per(i,n+1,2)
{
int lef=l[pos[i]],rig=r[pos[i]];
int lv=abs(a[pos[i]].fi-a[lef].fi);
int rv=abs(a[pos[i]].fi-a[rig].fi);
ans[i]=lv<=rv?mp(lv,a[lef].se):mp(rv,a[rig].se);
l[rig]=lef,r[lef]=rig;
}
rep(i,2,n+1) write(ans[i].fi,' '),write(ans[i].se);
//puts("");
}
int main()
{
//srand(time(0));debug();
//clock_t start_time=clock();
//freopen("C:\\Users\\Administrator\\Desktop\\in.txt","r",stdin);
//for(int QwQ=read();QwQ;QwQ--) solve();
while(~scanf("%d",&n)) solve();
//cerr<<"Time:"<<clock()-start_time<<"ms\n";
return 0;
}