Increasing Sequence CodeForces

Increasing Sequence CodeForces - 11A

很简单的贪心。由于不能减少元素，只能增加，过程只能是从左到右一个个看过去，看到一个小于等于左边的数的数就把它加到比左边大，并记录加的次数。

错误记录：

但是很容易错...以前错了4次..过几个月来再做还是不能1A...

比如下面这个有很明显错误的程序

#include<cstdio>
int n,d,last,now,ans;
int main()
{
    int i;
    scanf("%d%d",&n,&d);
    scanf("%d",&last);
    for(i=2;i<=n;i++)
    {
        scanf("%d",&now);
        if(now<=last)
        {
            ans+=(last-now)/d+1;
            now+=d*ans;
        }
        last=now;
    }
    printf("%d",ans);
    return 0;
}

2333333

#include<cstdio>
int n,d,last,now,ans;
int main()
{
    int i,tans;
    scanf("%d%d",&n,&d);
    scanf("%d",&last);
    for(i=2;i<=n;i++)
    {
        scanf("%d",&now);
        if(now<=last)
        {
            tans=(last-now)/d+1;
            ans+=tans;
            now+=d*tans;
        }
        last=now;
    }
    printf("%d",ans);
    return 0;
}