题解 100% AC

AC代码：

#include <bits/stdc++.h>
using namespace std;
int n,ans,pos;
int main(){
    freopen("apple.in","r",stdin);
    freopen("apple.out","w",stdout);
    cin>>n;
    while (n){
        ans++;
        if(!pos&&n%3==1)pos=ans;
        n-=(n+2)/3;
    }
    cout<<ans<<" "<<pos;
    fclose(stdin);
    fclose(stdout);
	return 0;
}

RE代码：

#include <bits/stdc++.h>
using namespace std;
struct apple{
	int id;
};
bool cmp(apple x,apple b){
	return x.id<b.id;
}
int main(){
    freopen("apple.in","r",stdin);
    freopen("apple.out","w",stdout);
    int n,nn,nnn,cnt=0,ans;
	cin>>n;
    vector<apple>a(n+1);
	nn=n;
	nnn=n;
	for(int i=1;i<=n;i++){
		a[i].id=i;
	}
	while(n>0){
		for(int i=1;i<=n;i+=3){
			if(a[i].id==nnn)ans=cnt+1;
			a[i].id=2147483647;
			nn--;
		}
		sort(a.begin(),a.end(),cmp);
		cnt++;
		n=nn;
	}
	cout<<cnt<<" "<<ans;
    fclose(stdin);
    fclose(stdout);
	return 0;
}