Codeforces Round #398 A. Snacktower

题目网址: Codeforces Round #398 A. Snacktower

题意分析:

思路:

• 要用一个 vis数组来表示x大的蛋糕是否已经下落
• 若当前最大的蛋糕下落了, 则输出玩这些蛋糕
• 否则输出空行

代码:

#include <iostream>using namespace std;const int SIZE = 1e5+5;bool vis[SIZE];int main(int argc, char const *argv[]){    int n;    int tmp;    while (~scanf("%d", &n))    {        int c = n;        for (int i = 0; i < n; ++i)        {            scanf("%d", &tmp);            vis[tmp] = true;            if(vis[c])            {                while (c)                {                    if(!vis[c]) break;                    printf("%d ", c);                    vis[c] = false;                    --c;                }                printf("\n");            }            else printf("\n");        }        printf("\n");    }    return 0;}