UVa12032 - The Monkey and the Oiled Bamboo(贪心)

#include <cstdio>#include <algorithm>usingnamespacestd;
constintN=100005;
intr[N], a[N];
intn;
boolinput();
intsolve();
intmain()
{
#ifndef ONLINE_JUDGEfreopen("d:\\OJ\\uva_in.txt", "r", stdin);
#endif // ONLINE_JUDGEintt;
scanf("%d", &t);
for (inti=1; i<=t; i++) {
input();
intans=solve();
printf("Case %d: %d\n", i, ans);
    }
return0;
}
boolinput()
{
scanf("%d", &n);
r[0] =0;
for (inti=1; i<=n; i++) {
scanf("%d", &r[i]);
    }
}
intsolve()
{
for (inti=0; i<n; i++) {
a[i] =r[i+1] -r[i];
    }
intans=-1;
for (inti=n-1; i>=0; i--) {
if (ans==a[i]) ans++;
ans=max(ans, a[i]);
    }
returnans;
}