UVA120istringstream和deque的用法

来源：互联网发布：虚拟主机绑定域名编辑：程序博客网时间：2024/06/07 07:44

这题自己敲的代码有些繁琐了，当然很多都是可以简化的，有些反复使用的东西完全可以写成函数的，当然即使写成函数也比

较麻烦，其实只要记得每次看最前面的位置是不是当前最大值，不是的话先把最大值翻到最前面然后再翻到这个位置，当时不知道

想的什么，写的这么麻烦，当然最简便的方法是使用istringstream和deque。分别贴上代码：

前面是别人简化些的代码，后面的是自己写的脑抽的代码，最后面是最简单的代码。

#include<cstdio><pre name="code" class="cpp">#include <cstdio>#include <cstring>int const maxn = 31;int arr[maxn], n;void rev(int cut) {printf("%d ", n - cut);for (int i = 0; i <= cut / 2; i++) {int tmp = arr[i];arr[i] = arr[cut - i];arr[cut - i] = tmp;}//for}//revint scan(void) {char ch = 0;memset(arr, 0, sizeof(arr));if (scanf("%d", &arr[0]) == EOF) return 0;int i = 1;while ((ch = getchar())  && ch != '\n') {scanf("%d", &arr[i++]);}//while return i;}//get a arrayint main() {freopen("in", "r", stdin);while (n = scan()) {printf("%d", arr[0]);for (int i = 1; i < n; i++)printf(" %d", arr[i]);printf("\n");int cnt = n;while (cnt) {int max = 0, rec;for (int i = 0; i < cnt; i++) {if (arr[i] > max) {max = arr[i];rec = i;}//if}//for   choose the maxif (rec != cnt - 1) {if (rec != 0)rev(rec);rev(cnt - 1);}cnt --;}//while    recycleprintf("0\n");}//whilereturn 0;}

#include<iostream>#include<vector>#include<queue>#include<algorithm>#include<string>#include<cstdlib>#include<map>#include<set>#include<cmath>#include<cstring>#include<cctype>#include<climits>#include<memory>using namespace std;#define LL long long#define INT (1<<31)-1;//2147483647const int N=5000;int cmp(int a,int b){ return a>b;}int main(){ char s[N]; while(gets(s)) { int num[40]; int len=0; int sum=0; for(int i=0;i<=strlen(s);i++) { if(s[i]==' '||s[i]=='\0') { num[len++]=sum; sum=0; } else { sum=sum*10+s[i]-'0'; } } for(int i=0;i<len-1;i++) cout<<num[i]<<' '; cout<<num[len-1]<<endl; int tnum[40]; int force=0; while(num[len-1]>num[len-2]&&(len-2)>=0) {len--;force++;} // cout<<force<<endl; int temp=0; for(int i=0;i<len;i++) { temp=max(temp,num[i]); } while(force&&num[len]<temp) {len++;force--;} memcpy(&tnum,&num,len*sizeof(int)); sort(tnum,tnum+len,cmp); // for(int i=0;i<len;i++) // { // cout<<tnum[i]<<' '<<num[i]<<endl; // } for(int i=0;i<len-1;i++) { int flag=1; for(int j=1;j<len;j++) { if(num[j]<num[j-1]) { flag=0; break; } } if(flag) break; int sit=0; for(;sit<len;sit++) { if(num[sit]==tnum[i]) break; } // cout<<tnum[i]<<endl; //cout<<sit<<endl; if(sit==0) { cout<<force+i+1<<' '; for(int j=0;j<(len-i)/2;j++) swap(num[j],num[len-i-j-1]); // for(int j=0;j<len;j++) // cout<<num[j]; } else { cout<<force+len-sit<<' '<<force+i+1<<' '; for(int j=0;j<=sit/2;j++) swap(num[j],num[sit-j]); for(int j=0;j<(len-i)/2;j++) swap(num[j],num[len-i-j-1]); } } cout<<0<<endl; } return 0;

#include<iostream>#include<cstdio>#include<vector>#include<cstring>#include<queue>#include<cctype>#include<cmath>#include<algorithm>#include<sstream>using namespace std;int main(){    char s[100];    deque<int> d;    deque<int>::iterator iter,maxn;    while(gets(s))    {        int a;        puts(s);        istringstream iss(s);        d.clear();        while(iss>>a) d.push_front(a);        for(iter=d.begin();iter!=d.end();++iter)        {                maxn=max_element(iter,d.end());                if(maxn!=iter)                {                    if(maxn!=d.end()-1)                    {                        reverse(maxn,d.end());                        cout<<maxn-d.begin()+1<<' ';                    }                    reverse(iter,d.end());                    cout<<iter-d.begin()+1<<' ';                }        }        puts("0");    }    return 0;}

0 0