bzoj2882 工艺

#include <cstdio>#include <cstdlib>#include <ctype.h>#define ll long long#define max(a,b) a>b?a:b#define min(a,b) a<b?a:btemplate<typename T>inline T read(T &f){    f=0;    int x=1;    char c=getchar();    while(!isdigit(c)){if(c=='-')x=-1;c=getchar();}    while(isdigit(c))f=f*10+c-'0',c=getchar();    return f=f*x;}const int maxn=300005;int n;int A[maxn];#define pos_i (i+k)%n#define pos_j (j+k)%n#define min(a,b) (a<b?a:b)int main(){    read(n);    for(int i=0;i<n;i++)        read(A[i]);    int i,j,k;    i=0;j=1;k=0;    while(i<n&&j<n){        k=0;        while(A[pos_i]==A[pos_j] && k<n)k++;        if(k==n)            break;        if(A[pos_i]>A[pos_j])            i=i+k+1;        else            j=j+k+1;        if(i==j)            j++;    }    i=min(i,j);    printf("%d",A[i]);    for(k=1;k<n;k++)        printf(" %d",A[pos_i]);    printf("\n");    return 0;}