洛谷p1228
虚假的递归:特解k=1,k=2的情形,其中k=2按照公主在边缘还是中间分5(8)类讨论,在k>2时强行递归。
真实的递归:将k的情形一般化为k-1的情形,直至k=1为止。分类少,逻辑清晰。注意是从1开始的,当要选择中间偏左那个值是x0+t1-1,如果要选取中间偏右那个值是x0+t1。
#include<bits/stdc++.h>
using namespace std;
void solve(int x0,int y0,int k,int x,int y){
//cout<<x0<<' '<<y0<<' '<<k<<' '<<x<<' '<<y<<endl;
if(k==1){
if(x==1&&y==1) cout<<x0+1<<' '<<y0+1<<' '<<1<<endl;
else if(x==1&&y==2) cout<<x0+1<<' '<<y0<<' '<<2<<endl;
else if(x==2&&y==1) cout<<x0<<' '<<y0+1<<' '<<3<<endl;
else cout<<x0<<' '<<y0<<' '<<4<<endl;
}else{
int t1=pow(2,k-1);
int h=pow(2,k);
if(x<=t1&&y<=t1){
solve(x0,y0,k-1,x,y);
cout<<x0+t1<<' '<<y0+t1<<' '<<1<<endl;//补上中间的3个点的块
solve(x0,y0+t1,k-1,t1,1);
solve(x0+t1,y0,k-1,1,t1);
solve(x0+t1,y0+t1,k-1,1,1);
}else if(x<=t1&&y>t1){
solve(x0,y0+t1,k-1,x,y-t1);
cout<<x0+t1<<' '<<y0+t1-1<<' '<<2<<endl;
solve(x0,y0,k-1,t1,t1);
solve(x0+t1,y0,k-1,1,t1);
solve(x0+t1,y0+t1,k-1,1,1);
}else if(x>t1&&y<=t1){
solve(x0+t1,y0,k-1,x-t1,y);
cout<<x0+t1-1<<' '<<y0+t1<<' '<<3<<endl;
solve(x0,y0,k-1,t1,t1);
solve(x0,y0+t1,k-1,t1,1);
solve(x0+t1,y0+t1,k-1,1,1);
}else{
solve(x0+t1,y0+t1,k-1,x-t1,y-t1);
cout<<x0+t1-1<<' '<<y0+t1-1<<' '<<4<<endl;
solve(x0,y0,k-1,t1,t1);
solve(x0+t1,y0,k-1,1,t1);
solve(x0,y0+t1,k-1,t1,1);
}
}
}
int main(){
int k,x,y;
cin>>k>>x>>y;
solve(1,1,k,x,y);
}