1403 有趣的堆栈

 1 #include<stdio.h>
 2 #include<algorithm>
 3 #include<iostream>
 4 #include<string.h>
 5 #include<stdlib.h>
 6 #include<queue>
 7 #include<set>
 8 #include<vector>
 9 #include<map>
10 using namespace std;
11 typedef long long LL;
12 int str[1000005];
13 int str1[2*1000005];
14 int cnt[1000005];
15 inline bool scan_d(int &num)  
16 {
17         char in;bool IsN=false;
18         in=getchar();
19         if(in==EOF) return false;
20         while(in!=‘-‘&&(in<‘0‘||in>‘9‘)) in=getchar();
21         if(in==‘-‘)
22   {
23    IsN=true;num=0;
24   }
25         else num=in-‘0‘;
26         while(in=getchar(),in>=‘0‘&&in<=‘9‘)
27   {
28                 num*=10,num+=in-‘0‘;
29         }
30         if(IsN) num=-num;
31         return true;
32 }
33 int main(void)
34 {
35         int n;
36         while(scanf("%d",&n)!=EOF)
37         {
38                 int i,j;
39                 memset(str1,-1,sizeof(str1));
40                 for(i = 1; i <= n; i++)
41                 {
42                         scanf("%d",&str[i]);
43                 }
44                 int u = n;
45                 for(i = 2*n; i >= 1; i--)
46                 {
47                         if(str1[i]==-1)
48                         {
49                                 str1[i] = 0;
50                                 str1[i-2*str[u]-1] = 1;
51                                 u--;
52                         }
53                 }int ac = 0;
54                 int k = 1;
55                 for(i = 1;i <= 2*n;i++)
56                 {
57                     if(str1[i]==1)
58                     {
59                         u++;
60                     }
61                     else
62                     {
63                         cnt[k++] = u;
64                     }
65                 }
66                 printf("%d",cnt[1]);
67                 for(i = 2;i <= n;i++)
68                 {
69                     printf(" %d",cnt[i]);
70                 }
71                 printf("\n");
72         }return 0;
73 }