Codeforces Round #695 (Div. 2)_A.Wizard of Orz(规律)

链接：https://codeforces.com/contest/1467/problem/A

题目
There are n digital panels placed in a straight line. Each panel can show any digit from 0 to 9. Initially, all panels show 0.

Every second, the digit shown by each panel increases by 1. In other words, at the end of every second, a panel that showed 9 would now show 0, a panel that showed 0 would now show 1, a panel that showed 1 would now show 2, and so on.

When a panel is paused, the digit displayed on the panel does not change in the subsequent seconds.

You must pause exactly one of these panels, at any second you wish. Then, the panels adjacent to it get paused one second later, the panels adjacent to those get paused 2 seconds later, and so on. In other words, if you pause panel x, panel y (for all valid y) would be paused exactly |x−y| seconds later.

For example, suppose there are 4 panels, and the 3-rd panel is paused when the digit 9 is on it.

The panel 1 pauses 2 seconds later, so it has the digit 1;
the panel 2 pauses 1 second later, so it has the digit 0;
the panel 4 pauses 1 second later, so it has the digit 0.
The resulting 4-digit number is 1090. Note that this example is not optimal for n=4.

Once all panels have been paused, you write the digits displayed on them from left to right, to form an n digit number (it can consist of leading zeros). What is the largest possible number you can get? Initially, all panels show 0.

题意
一开始会有n个时间板，每块板子上都有数字，一开始所有的数字都是0（例如“0000”）。
每过去1秒，每块板子上的数字都会+1（例如：“0000”1秒后会变为“1111”）。

你可以在任意时间段暂停一块板子的时间流动。
（本题关键所在，举例：“0000”变为“4444”后，暂停3号板子的增长，1s后“4444”变为“5545”，2s后变为“6545”，6545即为所得答案）

你现在可以在任意时间段暂停任意一块板子，问你你能够通过n块板子得到的最大数。

思路
当n=1时，毫无疑问，在板子为9时暂停时得到最大值“9”；
当n=2时，当板子出现“88”时暂停第二块板子，1s后会得到“98”；
当n=3时，当板子出现“888”时暂停第二块板子，1s后变为“989”。
（因为我们要保证数是最大的，所以至少我们要保证位数靠前的数尽量大，最后会发现，无论有多少板子，我们总是在所有板子为“8”时暂停第二块板子，这样就可以得到最大数）

类推后，n块板子可以得到的最大数就是“98901234567890123…”

上代码，伊丽莎白！

代码

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#define inf 0x3f3f3f
using namespace std;
const int maxn=1e6+10;
typedef long long ll;
int main()
{
    int n,t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        if(n==1)
            printf("9");
        else if(n==2)
            printf("98");
        else if(n==3)
            printf("989");
        else
        {
            printf("989");
            int ans=0;
            for(int i=1;i<=n-3;i++)
            {
                printf("%d",ans);
                ans++;
                if(ans==10)
                    ans=0;
            }
        }
        printf("\n");
    }
}

U咩U咩！！！