1067. Sort with Swap(0,*) (25)
2015-02-14 10:40
429 查看
用map存超时了,换成结构体可能会省点时间,然后用二分
#include <cstdio>
#include <map>
using namespace std;
map<int,int> mp;
map<int,int>::iterator it;
void myswap(int &cnt){
map<int,int>::iterator it=mp.begin();
while(it->second!=0){
cnt++;
int tmp=it->second;
it=mp.find(tmp);
mp[0]=it->second;
mp[tmp]=tmp;
it=mp.begin();
}
//mp[it->second]=it->second;
}
//0表示还有没有归位的,1表示全部完成排序
int myfind(map<int,int>::iterator &it,int &cnt){
for(it=mp.begin();it!=mp.end();it++){
if(it->first!=it->second){
if(mp[0]==0){
mp[0]=it->second;
mp[it->first]=0;
cnt++;
}
return 0;
}
}
return 1;
}
int main(){
freopen("in.txt","r",stdin);
int n,s;
scanf("%d",&n);
for(int i=0;i<n;i++){
int x;
scanf("%d",&x);
mp[x]=i;
}
int cnt=0;
it=mp.begin();
while(1){
int flag=myfind(it,cnt);
if(flag==1){
break;
}
myswap(cnt);
}
printf("%d\n",cnt);
return 0;
}
#include <cstdio>
#include <map>
using namespace std;
map<int,int> mp;
map<int,int>::iterator it;
void myswap(int &cnt){
map<int,int>::iterator it=mp.begin();
while(it->second!=0){
cnt++;
int tmp=it->second;
it=mp.find(tmp);
mp[0]=it->second;
mp[tmp]=tmp;
it=mp.begin();
}
//mp[it->second]=it->second;
}
//0表示还有没有归位的,1表示全部完成排序
int myfind(map<int,int>::iterator &it,int &cnt){
for(it=mp.begin();it!=mp.end();it++){
if(it->first!=it->second){
if(mp[0]==0){
mp[0]=it->second;
mp[it->first]=0;
cnt++;
}
return 0;
}
}
return 1;
}
int main(){
freopen("in.txt","r",stdin);
int n,s;
scanf("%d",&n);
for(int i=0;i<n;i++){
int x;
scanf("%d",&x);
mp[x]=i;
}
int cnt=0;
it=mp.begin();
while(1){
int flag=myfind(it,cnt);
if(flag==1){
break;
}
myswap(cnt);
}
printf("%d\n",cnt);
return 0;
}
相关文章推荐
- PAT 1067. Sort with Swap(0,*) (25)
- 1067. Sort with Swap(0,*) (25)
- 1067. Sort with Swap(0,*) (25)
- 1067. Sort with Swap(0,*) (25)【贪心】——PAT (Advanced Level) Practise
- 1067. Sort with Swap(0,*) (25)
- 1067. Sort with Swap(0,*) (25)
- 1067. Sort with Swap(0,*) (25)
- 1067. Sort with Swap(0,*) (25)
- PAT 1067. Sort with Swap(0,*) (25)
- 【PAT】1067. Sort with Swap(0,*) (25)
- 1067. Sort with Swap(0,*) (25)
- 1067. Sort with Swap(0,*) (25)
- 【PAT】【Advanced Level】1067. Sort with Swap(0,*) (25)
- 1067. Sort with Swap(0,*) (25)
- 1067. Sort with Swap(0,*) (25)
- 1067. Sort with Swap(0,*) (25)
- 1067. Sort with Swap(0,*) (25)
- 1067. Sort with Swap(0,*) (25)
- PAT - 甲级 - 1067. Sort with Swap(0,*) (25)(模拟+贪心)
- 1067. Sort with Swap(0,*) (25)