时间超了,求大佬指点

P1160 队列安排

/* 4 1 0 2 1 1 0 2 3 3 */ #include<./bits/stdc++.h> using namespace std; int main() { int n = 0;//4 cin>>n; int arr[n+n] ={};//3 2 1 bool p = 0; //1 2 3 4 int k = 0; arr[1]=1; for(int i = 2;i<=n;i++)//i=3 { cin>>k>>p;//2 1 if(p==0) { int a = 0; for(int x = 1;x<i;x++) { if(arr[x]==k) { a=x; break; } } for(int j = (i-1);j>=a;j--) { arr[j+1]=arr[j]; } arr[a]=i; } if(p==1) { int a = 0; for(int x = 1;x<i;x++) { if(arr[x]==k) { a=x; break; } } for(int j = (i-1);j>a;j--) { arr[j+1]=arr[j]; } arr[a+1]=i; } } int m = 0; cin>>m; int temp = 0; for(int i = 0;i<m;i++) { cin>>temp; for(int j = 1;j<=n;j++) { if(arr[j]==temp) { arr[j]=n+1; } } } int f = 0; for(int i = 1;i<=n;i++) { if(arr[i]!=(n+1)) { if(f==0) cout<<arr[i]; else cout<<" "<<arr[i]; f++; } } cout<<endl; return 0; }
by 冬冬 @ 2019-07-16 19:37:38


/* 4 1 0 2 1 1 0 2 3 3 */ #include<./bits/stdc++.h> using namespace std; int main() { int n = 0;//4 cin>>n; int arr[n+n] ={};//3 2 1 bool p = 0; //1 2 3 4 int k = 0; arr[1]=1; for(int i = 2;i<=n;i++)//i=3 { cin>>k>>p;//2 1 if(p==0) { int a = 0; for(int x = 1;x<i;x++) { if(arr[x]==k) { a=x; break; } } for(int j = (i-1);j>=a;j--) { arr[j+1]=arr[j]; } arr[a]=i; } if(p==1) { int a = 0; for(int x = 1;x<i;x++) { if(arr[x]==k) { a=x; break; } } for(int j = (i-1);j>a;j--) { arr[j+1]=arr[j]; } arr[a+1]=i; } } int m = 0; cin>>m; int temp = 0; for(int i = 0;i<m;i++) { cin>>temp; for(int j = 1;j<=n;j++) { if(arr[j]==temp) { arr[j]=n+1; } } } int f = 0; for(int i = 1;i<=n;i++) { if(arr[i]!=(n+1)) { if(f==0) cout<<arr[i]; else cout<<" "<<arr[i]; f++; } } cout<<endl; return 0; }
by 冬冬 @ 2019-07-16 19:38:17


先排版吧
by wloving @ 2019-08-04 19:45:35


|