Codeforces Round #226 (Div. 2)A. Bear and Raspberry

 /*
　　　 贪心的找到相邻两项差的最大值，再减去c，结果若是负数答案为0.
 */
 1 #include <stdio.h>
#define maxn 105
int num[maxn];
int main()
{
    int n,c;
    while(~scanf("%d%d",&n,&c))
    {
        int ans = 0;
        for(int i = 0;i < n;i++)
            scanf("%d",num+i);
        for(int i = 0;i < n-1;i++){
            int temp = num[i] - num[i+1];
            if(temp > ans)
                ans = temp;
        }
        ans -= c;
        if(ans>=0)
            printf("%d\n",ans);
        else
            printf("0\n");
    }
}