text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s = 0, c, A, m, B;
cin >> n >> c >> m;
for (int i = 1; i < n; i++) {
cin >> A;
B = m - A - c;
if (B > s) s = B;
m = A;
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, c, t, m = 0;
cin >> n >> c;
vector<int> a;
for (int i = 0; i < n; i++) {
cin >> t;
a.push_back(t);
}
for (int i = 0; i < n - 1; i++) {
if (a[i] - a[i + 1] - c > m) m = a[i] - a[i + 1] - c;
}
cout << m << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
scanf("%d%d", &n, &c);
int x[n];
for (int i = 0; i < n; i++) scanf("%d", &x[i]);
int m = 0;
for (int i = 0; i < n - 1; i++) m = max(m, x[i] - x[i + 1] - c);
printf("%d", m);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
cin >> a >> b;
int c[a];
int sum = -1;
for (int i = 1; i <= a; i++) {
cin >> c[i];
}
for (int i = 2; i <= a; i++) {
if (c[i - 1] - c[i] > sum) {
sum = c[i - 1] - c[i];
}
}
if (sum - b > -1)
cout << sum - b;
else
cout << 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[222];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
int ans = m;
for (int i = 0; i < n - 1; i++)
if (a[i] - a[i + 1] > ans) ans = a[i] - a[i + 1];
cout << ans - m << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
int main() {
int n, c, x, y, ans = 0;
scanf("%d%d", &n, &c);
scanf("%d", &y);
for (int i = (0); i < (n - 1); ++i) {
scanf("%d", &x);
ans = max(y - x - c, ans);
y = x;
}
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int x, y, maxx, w[101];
int main() {
cin >> x >> y;
for (int i = 0; i < x; i++) {
cin >> w[i];
if (i == 1) maxx = w[i - 1] - w[i];
if (i > 1) maxx = max(w[i - 1] - w[i], maxx);
}
for (int i = 1; i < x; i++) {
if (w[i - 1] - w[i] == maxx) {
if (w[i - 1] - w[i] - y >= 0) {
cout << w[i - 1] - w[i] - y;
return 0;
}
if (w[i - 1] - w[i] - y < 0) {
cout << 0;
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
int d[n], t(0);
for (int i = 0; i < n; i++) cin >> d[i];
for (int i = 0; i < n; i++) t = max(t, d[i] - d[i + 1] - c);
cout << t << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int Ndays, discount;
cin >> Ndays >> discount;
int arrdays[100];
int arrsub[100] = {0};
for (int i = 0; i < Ndays; i++) {
cin >> arrdays[i];
}
for (int i = 0; i < Ndays - 1; i++) {
arrsub[i] = arrdays[i] - arrdays[i + 1];
}
int max = 0;
for (int i = 0; i < Ndays - 1; i++) {
if (max < arrsub[i]) max = arrsub[i];
}
if (max > discount)
cout << max - discount;
else
cout << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[200010];
long long pref[200010];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, k;
cin >> n >> k;
for (long long i = 1; i <= n; i++) cin >> a[i];
long long ans = 0;
for (long long i = 0; i < n; i++) ans = max(ans, a[i] - a[i + 1] - k);
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
scanf("%d %d", &n, &c);
int prev;
scanf("%d", &prev);
int profit = 0;
for (int i = 1; i < n; i++) {
int curr;
scanf("%d", &curr);
profit = max(profit, prev - curr - c);
prev = curr;
}
printf("%d\n", profit);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
vector<int> v(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v[i] = a;
}
int biggestdif = 0;
for (int i = 0; i < n - 1; i++) {
if (v[i] - v[i + 1] > biggestdif) biggestdif = v[i] - v[i + 1];
}
cout << max(0, biggestdif - c);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int arr[n], maxdiff = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int j = 0; j < n - 1; j++) {
if (arr[j] - arr[j + 1] > maxdiff) {
maxdiff = arr[j] - arr[j + 1];
}
}
if (maxdiff - m > 0)
cout << maxdiff - m;
else
cout << 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
int val[n];
for (int i = 0; i < n; i++) {
cin >> val[i];
}
int max = 0;
for (int i = 0; i < n - 1; i++) {
if (val[i] > val[i + 1] + c) {
if (max < val[i] - val[i + 1] - c) max = val[i] - val[i + 1] - c;
}
}
cout << max << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int readint() {
int t = 0;
char c, ch = getchar();
if (ch == '-')
c = getchar();
else
c = ch;
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') {
t = (t << 3) + (t << 1) + c - '0';
c = getchar();
}
if (ch == '-')
return -t;
else
return t;
}
int main() {
std::ios_base::sync_with_stdio(false);
int c, i, j, k, t, n, m, x, y, ans = 0, a[102];
cin >> n >> c;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n - 1; i++) {
if (a[i] - a[i + 1] > ans) ans = a[i] - a[i + 1];
}
if (ans >= c)
ans = ans - c;
else
ans = 0;
cout << ans << endl;
;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void initc() {}
int main() {
initc();
int n, c, i, t, x = 0;
cin >> n >> c;
int a[n], p[n - 1];
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < n - 1; i++) p[i] = a[i] - a[i + 1];
int m = 0;
for (i = 1; i < n - 1; i++) {
if (p[i] > p[m]) m = i;
}
t = a[m] - a[m + 1] - c;
if (t > 0)
cout << t;
else
cout << x;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int n, i, c, m = 0;
cin >> n >> c;
long long int a[n];
cin >> a[0];
for (i = 1; i < n; i++) {
cin >> a[i];
if (a[i - 1] - a[i] - c > 0) m = max(m, a[i - 1] - a[i] - c);
}
cout << m;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int cnt = 0, sum = 0;
for (int i = 0; i < n - 1; i++) {
cnt = a[i] - a[i + 1] - k;
sum = max(sum, cnt);
}
sum = max(sum, 0);
cout << sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int t = 0;
int j = -1;
for (int i = 0; i < n - 1; i++) {
if (a[i] - a[i + 1] > t) {
t = a[i] - a[i + 1];
j = i;
}
}
if (j == -1)
cout << 0 << endl;
else {
int cost = a[j] - a[j + 1] - k;
if (cost > 0)
cout << cost << endl;
else
cout << 0 << endl;
}
}
|
#include <bits/stdc++.h>
int main() {
int x, i, a[104], n, c, y;
scanf("%d %d", &n, &c);
x = 0;
for (i = 0; i < n; i++) scanf("%d", &a[i]);
for (i = 0; i < n - 1; i++) {
y = a[i] - a[i + 1] - c;
if (y > x) x = y;
}
printf("%d\n", x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000;
int N, C, data[MAXN];
int main() {
cin >> N >> C;
for (int i = 0; i < N; i++) {
cin >> data[i];
}
int ans = 0;
for (int i = 0; i < N - 1; i++) {
if (data[i] - data[i + 1] - C > ans) {
ans = data[i] - data[i + 1] - C;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, a;
cin >> n >> c;
int mx = 0, cur = 0;
for (int i = 0; i < n; i++) {
cin >> a;
if (cur - a - c > mx) mx = cur - a - c;
cur = a;
}
cout << mx;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int days, rentPrice, currDayPrice = 0, afterCurrDayPrice = 0, minus,
prices[100];
minus = 0;
cin >> days >> rentPrice;
for (int i = 1; i < days + 1; i++) {
cin >> prices[i];
}
for (int i = 1; i < days + 1; i++) {
if (i == days) break;
int diff = prices[i] - prices[i + 1];
if (diff > minus) {
minus = diff;
currDayPrice = prices[i];
afterCurrDayPrice = prices[i + 1];
}
}
int earn = (currDayPrice - afterCurrDayPrice) - rentPrice;
if (((currDayPrice + afterCurrDayPrice) == 0) ||
((currDayPrice - afterCurrDayPrice) <= rentPrice))
earn = 0;
cout << earn;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[10000], b, tcase = 1, t, n, i, c, ans = 0;
scanf("%d %d", &n, &c);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n - 1; i++) {
if (a[i] - a[i + 1] - c > ans) {
ans = a[i] - a[i + 1] - c;
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 0;
for (int i = 1; i < n; i++) {
ans = max(ans, a[i - 1] - a[i] - c);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, c[101], d, k = 101, i;
int main() {
cin >> a >> b;
for (i = 0; i < a; i++) {
cin >> c[i];
}
for (i = 0; i < a - 1; i++) {
if (c[i] - c[i + 1] - b > d) d = c[i] - c[i + 1] - b;
}
if (d > 0)
cout << d << endl;
else
cout << 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
vector<int> v(n), vb(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ma = 0;
for (int i = 0; i < n - 1; i++) {
vb[i] = v[i] - v[i + 1];
ma = max(ma, vb[i]);
}
if (ma <= 0 || (ma - c) <= 0)
cout << 0 << '\n';
else
cout << ma - c << "\n";
}
|
#include <bits/stdc++.h>
int S[101], n, c, m = 0;
int main() {
scanf("%d%d", &n, &c);
for (int i = 0; i < n; i++) scanf("%d", &S[i]);
for (int i = 0; i < n - 1; i++)
if (m < S[i] - S[i + 1]) m = S[i] - S[i + 1];
printf("%d", m - c > 0 ? (m - c) : 0);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int arr[a];
cin >> arr[0];
int ans = 0;
for (int i = 1; i < a; i++) {
cin >> arr[i];
ans = max(arr[i - 1] - arr[i] - b, ans);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, sum = 0;
cin >> n >> c;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n - 1; i++) {
sum = max(sum, (a[i] - a[i + 1] - c));
}
cout << sum;
}
|
#include <bits/stdc++.h>
int main() {
int cost[101], i, count, must, max1 = 0;
scanf("%d%d", &count, &must);
for (i = 0; i < count; ++i) scanf("%d", &cost[i]);
for (i = 0; i < count - 1; ++i)
if (cost[i] - cost[i + 1] - must > max1)
max1 = cost[i] - cost[i + 1] - must;
if (max1 <= 0)
printf("0");
else
printf("%d", max1);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
int ar[n], arr[n - 1];
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
for (int i = 0; i < n - 1; i++) {
arr[i] = ar[i] - ar[i + 1] - c;
}
int *max;
max = max_element(arr, arr + (n - 1));
if ((*max) > 0) {
cout << *max;
} else {
cout << 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int max = a[0] - a[1];
for (int i = 0; i < n - 1; i++) {
if (a[i] - a[i + 1] > max) {
max = a[i] - a[i + 1];
}
}
if (max - c > 0) {
cout << max - c;
} else
cout << "0";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, c, a;
cin >> n >> c;
vector<int> arr;
for (int i = 0; i < n; i++) {
cin >> a;
arr.push_back(a);
}
int maxx = 0;
for (int i = 0; i < n - 1; i++) {
maxx = max(maxx, arr[i] - arr[i + 1] - c);
}
cout << maxx;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
vector<int> num;
num.resize(n);
for (int i = 0; i < num.size(); i++) cin >> num[i];
int maxi = 0;
for (int i = 0; i < num.size() - 1; i++) {
maxi = max(maxi, num[i] - num[i + 1] - c);
}
cout << maxi << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
int xprev = 0, x;
cin >> x;
int ans = 0;
for (int i = 1; i < n; i++) {
xprev = x;
cin >> x;
ans = max(ans, xprev - x - c);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int mx = -99999;
for (int i = 0; i < n - 1; i++) mx = max(mx, a[i] - a[i + 1] - k);
if (mx < 0) mx = 0;
printf("%d\n", mx);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long n, a[1000], i, ans, x;
int main() {
cin >> n >> x;
ans = 0;
for (i = 1; i <= n; i++) cin >> a[i];
for (i = 2; i <= n; i++) ans = max(ans, a[i - 1] - a[i] - x);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, rent, MAX = 0;
cin >> n >> rent;
vector<int> v(n);
cin >> v[0];
for (int i = 1; i < n; i++) {
cin >> v[i];
MAX = max(MAX, v[i - 1] - v[i] - rent);
}
cout << MAX << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, maxx = 0, k;
scanf("%d %d", &n, &k);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n - 1; i++) {
maxx = max(maxx, a[i] - a[i + 1]);
}
if (maxx - k < 0) {
printf("0\n");
return 0;
}
printf("%d\n", maxx - k);
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:100000000000,100000000000")
const long long INF = 2009000999;
const float cp = 2 * acos(0.0);
const float eps = 1e-18;
const long long mod = 1000007;
using namespace std;
int main() {
long long n, c, mx = 0;
vector<long long> d;
cin >> n >> c;
d.resize(n);
for (int(i) = 0; (i) < (n); i++) cin >> d[i];
for (int(i) = 0; (i) < (n - 1); i++) {
long long k = d[i];
k -= d[i + 1] + c;
mx = max(mx, k);
}
cout << mx;
}
|
#include <bits/stdc++.h>
int main() {
int n, c, i, dif;
scanf("%d %d", &n, &c);
int ar[110];
for (i = 1; i <= n; i++) {
scanf("%d", &ar[i]);
}
int maxpos = 0, max = 0, f = 0;
for (i = 1; i <= n - 1; i++) {
if (ar[i] > ar[i + 1]) {
f = 1;
dif = ar[i] - ar[i + 1];
if (dif > max) {
max = dif;
maxpos = i;
}
}
}
if (f) {
int p = ar[maxpos] - ar[maxpos + 1] - c;
if (p <= 0)
printf("0");
else
printf("%d", p);
} else
printf("0");
exit(0);
}
|
#include <bits/stdc++.h>
using namespace std;
int n, c, ar[120], in1, in2, i, j, out;
int main(void) {
scanf("%d%d", &n, &c);
j = 0;
for (i = 0; i < n; i++) {
scanf("%d", &in1);
if (i > 0) ar[j++] = in2 - in1;
in2 = in1;
}
sort(ar, ar + j);
j = j - 1;
if ((ar[j] - c) > 0)
printf("%d\n", ar[j] - c);
else
printf("0\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z, i, j;
vector<int> a;
vector<int> b;
vector<int> c;
cin >> x >> y;
for (i = 0; i < x; i++) {
cin >> z;
a.push_back(z);
}
int diff = 0;
int counter2 = 0;
for (i = 0; i < a.size(); i++) {
if (i == x - 1) {
break;
}
if (a[i] > a[i + 1]) {
diff = a[i] - a[i + 1];
c.push_back(diff);
counter2++;
}
}
if (counter2 == 0) {
cout << "0";
} else {
int max = c[0];
for (i = 0; i < c.size(); i++) {
if (c[i] > max) {
max = c[i];
}
}
for (i = 0; i < a.size(); i++) {
if (i == x - 1) {
break;
}
if (a[i] - a[i + 1] == max) {
if (a[i] - a[i + 1] - y < 0) {
cout << "0";
break;
} else {
cout << a[i] - a[i + 1] - y;
break;
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int max = 0;
int last;
cin >> last;
for (int i = 1; i < a; i++) {
int temp;
cin >> temp;
if (last - temp > max) max = last - temp;
last = temp;
}
if (max - b < 0)
cout << 0;
else
cout << (max - b);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, c, max = -1, pt = -1;
scanf("%d %d", &n, &c);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n - 1; i++) {
if (a[i] >= a[i + 1]) {
int s = a[i] - a[i + 1] - c;
if (max < s) max = s;
}
}
if (max == -1)
printf("%d", 0);
else
printf("%d", max);
return 0;
}
|
#include <bits/stdc++.h>
int main(void) {
int n, c;
scanf("%d %d", &n, &c);
int a[n], i, max = 0;
for (i = 0; i < n; ++i) scanf("%d", &a[i]);
for (i = 0; i < n - 1; ++i) {
if ((a[i] - a[i + 1]) > max) max = a[i] - a[i + 1];
}
if ((max - c) > 0)
printf("%d", max - c);
else
printf("0");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, all[100008];
int c;
int main() {
int ans = 0;
scanf("%d%d", &n, &c);
for (int i = 0; i < n; i++) scanf("%d", &all[i]);
for (int i = 0; i < n - 1; i++) {
ans = max(ans, all[i] - all[i + 1] - c);
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, c, x[105], ans;
int main() {
ios::sync_with_stdio(false), cout.tie(NULL), cin.tie(NULL);
;
cin >> n >> c;
for (int i = 0; i < n; i++) cin >> x[i];
for (int i = 0; i < n - 1; i++) ans = max(ans, x[i] - x[i + 1]);
cout << max(ans - c, 0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long int a[102], m, n, c, i;
int main() {
cin >> n >> c;
for (i = 1; i <= n; i++) {
cin >> a[i];
if (i != 1 && a[i - 1] - a[i] - c > m) m = a[i - 1] - a[i] - c;
}
cout << m << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, a, b, d, max = 0;
cin >> n >> c;
cin >> a;
for (int i = 2; i <= n; i++) {
cin >> b;
d = a - b - c;
if (d > max) max = d;
a = b;
}
cout << max << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[101];
int main() {
int n, c, m, i;
m = INT_MIN;
cin >> n >> c;
for (i = 0; i < n; i++) {
cin >> a[i];
if (i > 0 && m < a[i - 1] - a[i] - c) {
m = a[i - 1] - a[i] - c;
}
}
if (m > 0) {
cout << m;
} else {
cout << 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, i, j, p = 0, q;
cin >> n >> c;
int x[n];
int profit[n * n];
for (i = 0; i < n; i++) {
cin >> x[i];
}
for (i = 0; i < n - 1; i++) {
profit[p] = x[i] - x[i + 1] - c;
p++;
}
q = *max_element(profit, profit + p);
if (q < 0)
cout << "0";
else
cout << q;
}
|
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int i;
int c;
int a[1001];
scanf("%d", &c);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
int diff = -1;
int max = 0;
for (i = 0; i < n - 1; i++) {
diff = a[i] - a[i + 1] - c;
if (diff >= max) max = diff;
}
printf("%d", max);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, counter = 0, profit1, profit2 = 0;
cin >> n >> c;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
if (arr[i] > arr[i + 1] && (arr[i] - arr[i + 1] - c > 0)) {
profit1 = (arr[i] - arr[i + 1] - c);
if (profit1 > profit2) {
profit2 = profit1;
}
}
}
cout << profit2 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
int a[n], k[n];
for (int i = 0; i < n; i++) k[i] = 0;
for (int i = 0; i < n; i++) cin >> a[i];
for (int j = 0; j < n - 1; j++) {
if (a[j] > a[j + 1]) k[j] = a[j] - a[j + 1] - c;
}
int m = k[0];
for (int i = 0; i < n - 1; i++) {
if (k[i + 1] > m) m = k[i + 1];
}
cout << m << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
int price[maxn];
int main() {
int n, c;
cin >> n >> c;
for (int i = 0; i < n; i++) {
cin >> price[i];
}
int maxRa = 0;
for (int i = 0; i < n - 1; i++) {
maxRa = max(maxRa, price[i] - price[i + 1]);
}
cout << max(0, maxRa - c) << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a[105], i, s, k, n, m;
scanf("%d%d", &n, &m);
k = 0;
scanf("%d", &a[0]);
for (i = 1; i < n; i++) {
scanf("%d", &a[i]);
s = a[i - 1] - a[i] - m;
if (s > k) k = s;
}
printf("%d\n", k);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int d, cost, store = 0;
cin >> d >> cost;
int a[d];
for (int i = 0; i < d; i++) {
cin >> a[i];
}
for (int i = 0; i < d - 1; i++) {
if (a[i] - cost - a[i + 1] > 0 && (a[i] - cost - a[i + 1]) > store) {
store = a[i] - cost - a[i + 1];
}
}
cout << store;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int asd[110];
int main() {
int n;
int c;
cin >> n >> c;
int pr = 0;
for (int i = 0; i < n; i++) {
cin >> asd[i];
if (i > 0) {
pr = max(asd[i - 1] - asd[i] - c, pr);
}
}
cout << pr << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
int x, xprev, biggestdiff = 0;
cin >> n >> c;
cin >> xprev;
for (int i = 0; i < n - 1; i++) {
cin >> x;
if (xprev - x > biggestdiff) biggestdiff = xprev - x;
xprev = x;
}
if (biggestdiff - c <= 0)
cout << "0";
else
cout << biggestdiff - c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, k, a, an, ans;
scanf("%d%d", &n, &m);
scanf("%d", &k);
an = 0;
for (i = 1; i < n; i++) {
scanf("%d", &a);
an = max(an, k - a);
k = a;
}
ans = an - m;
if (ans <= 0)
printf("0\n");
else
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, m = 0, x, arr[1001];
cin >> n >> c;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 1; i < n; i++) {
if (arr[i - 1] - arr[i] - c > m) m = arr[i - 1] - arr[i] - c;
}
cout << m;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-6;
int main() {
int n, c, v;
cin >> n >> c;
vector<int> a;
for (int i = 0; i <= n - 1; i++) {
cin >> v;
a.push_back(v);
}
int ans = 0;
for (int i = 0; i <= n - 2; i++) {
ans = max(ans, a[i] - a[i + 1] - c);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[110], n, ans = 0, m;
void init() {
cin >> n >> m;
for (int i = (1); i <= (n); ++i) cin >> a[i];
for (int i = (1); i <= (n - 1); ++i) ans = max(ans, a[i] - a[i + 1]);
ans = max(0, ans - m);
cout << ans;
}
void work() {}
int main() {
init();
work();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, c, a[2], r = 0;
int main() {
cin >> n >> c >> a[0];
for (int i = 1; i < n; i++)
cin >> a[i % 2], r = max(r, a[i % 2 ^ 1] - a[i % 2] - c);
cout << r;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
int curr, prec;
cin >> prec;
int maxProfit = 0;
for (int i = 2; i <= n; ++i) {
cin >> curr;
if (prec - curr - c > maxProfit) {
maxProfit = prec - curr - c;
}
prec = curr;
}
cout << maxProfit;
}
|
#include <bits/stdc++.h>
using namespace std;
const int VISITED = 1;
const int UNVISITED = -1;
const long long OO = 1e12;
const int OOI = 1e9;
int xdir[] = {1, -1, 0, 0};
int ydir[] = {0, 0, -1, 1};
void file() {}
int n, c, arr[100 + 9];
int main() {
file();
cin >> n >> c;
for (int i = 0; i < n; i++) cin >> arr[i];
int ans = 0;
for (int i = 0; i < n - 1; i++) ans = max(arr[i] - arr[i + 1] - c, ans);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, c;
long i;
cin >> n >> c;
long a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
int max = 0;
for (i = 0; i < n - 1; i++) {
int t = a[i] - a[i + 1] - c;
if (t > max) {
max = t;
}
}
cout << max;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, c, max, i;
int data[105];
scanf("%d%d", &n, &c);
data[0] = 0;
max = 0;
for (i = 1; i <= n; i++) {
scanf("%d", &data[i]);
if (data[i - 1] - data[i] > max) max = data[i - 1] - data[i];
}
if (max - c >= 0)
printf("%d\n", max - c);
else
printf("0\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, x[100];
cin >> n >> c;
for (int i(0); i < n; ++i) cin >> x[i];
int ans = 0;
for (int i(0); i < n - 1; ++i) ans = max(ans, x[i] - x[i + 1] - c);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long double dist(pair<long double, long double> a,
pair<long double, long double> b) {
return sqrt((a.first - b.first) * (a.first - b.first) +
(a.second - b.second) * (a.second - b.second));
}
bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
return false;
}
long long GCD(long long a, long long b) {
if (b == 0) return a;
return GCD(b, a % b);
}
long long bigMod(long long x, long long p) {
if (p == 0) return 1;
if (p == 1) return x;
if ((!(p & 1))) {
long long temp = bigMod(x, p / 2);
return (temp * temp) % 1000000007;
}
return (x * bigMod(x, p - 1)) % 1000000007;
}
long double moddist(pair<long long, long long> st,
pair<long long, long long> end,
pair<long long, long long> p) {
long double ans = 0;
long double f = (long double)(end.first - st.first) * (st.second - p.second);
long double s = (long double)(st.first - p.first) * (end.second - st.second);
ans = abs((f - s) / dist(st, end));
return (ans <= 1e-14 ? 10000000000000000LL : ans);
}
int n;
inline bool valid(int i, int j) { return (i >= 0 && j >= 0 && i < n && j < n); }
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int c, x, y = 0, maxi = 0;
cin >> n >> c;
for (int i = 0; i < int(n); i++) cin >> x, maxi = max(maxi, y - x), y = x;
return cout << (maxi - c > 0 ? maxi - c : 0) << endl, 0;
;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, r, x;
cin >> n >> r;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 0;
for (int i = 1; i < n; i++) {
ans = max(a[i - 1] - a[i] - r, ans);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
set<int> profit;
vector<int> prices;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
prices.push_back(x);
}
for (int i = 0; i < n - 1; ++i) {
int x;
x = prices[i] - prices[i + 1] - c;
profit.insert(x);
}
int x;
for (int j : profit) {
x = j;
}
if (x < 0) {
cout << 0;
return 0;
}
cout << x;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, pr, mx = 0, a;
cin >> n >> c;
cin >> a;
pr = a;
for (int i = 1; i < n; i++) {
scanf("%d", &a);
mx = max(mx, pr - a - c);
pr = a;
}
cout << mx;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200;
int a[maxn];
int main() {
int n, c;
while (scanf("%d%d", &n, &c) != EOF) {
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
int res = -1;
for (int i = 0; i < n - 1; i++) {
int tmp = a[i] - a[i + 1];
res = max(res, tmp);
}
res -= c;
if (res < 0)
puts("0");
else
printf("%d\n", res);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, i;
cin >> n >> c;
int s[n];
for (i = 0; i < n; i++) {
cin >> s[i];
}
int d = 0, max1 = 0;
for (i = 1; i < n; i++) {
d = s[i - 1] - s[i];
if (max1 < d) {
max1 = d;
}
}
if (max1 - c < 0) {
cout << 0;
return 0;
}
cout << max1 - c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, a;
vector<int> lista;
cin >> n >> c;
for (int i = 0; i < n; i++) {
cin >> a;
lista.push_back(a);
}
int res = 0;
for (int i = 0; i < n - 1; i++) {
int aux = lista[i] - c - lista[i + 1];
if (aux > res) {
res = aux;
}
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long x, a, b, ans = 0;
cin >> x;
while (n--) {
cin >> a;
if (x - a - k > ans) ans = (x - a - k);
x = a;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
class SignedReader {
char arr[262144];
char *p, *e;
int s, val;
bool neg;
void getTok() {
p = arr;
s = fread(arr, 1, 262144, stdin);
e = arr + s;
}
void skip() {
while (true) {
if (p == e) getTok();
if (*p == '-' || ((*p) >= '0' && (*p) <= '9')) return;
p++;
}
}
public:
SignedReader() { getTok(); }
int nextInt() {
neg = false;
skip();
if (*p == '-') neg = true, p++;
val = 0;
while (true) {
if (p == e) getTok();
if (p == e) break;
if (((*p) >= '0' && (*p) <= '9'))
val = 10 * val + *p - 48, p++;
else
break;
}
if (neg) val = -val;
return val;
}
};
int main() {
int a[105];
int n, c;
cin >> n >> c;
int best = 0;
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
if (i) best = max(best, a[i - 1] - a[i] - c);
}
cout << best << endl;
return 0;
}
|
#include <bits/stdc++.h>
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int N, arr[105], c, i;
int main() {
int ans = 0;
scanf("%d %d", &N, &c);
for (i = 1; i <= N; i++) scanf("%d", &arr[i]);
int tmp = 0;
for (i = 1; i < N; i++) {
tmp = arr[i] - arr[i + 1] - c;
ans = max(ans, tmp);
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
if (a < b) a = b;
}
int power(int a, int b, int m, int ans = 1) {
for (; b; b >>= 1, a = 1LL * a * a % m)
if (b & 1) ans = 1LL * ans * a % m;
return ans;
}
int a[110];
int main() {
int n, c;
scanf("%d%d", &n, &c);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
int m = 0;
for (int i = 1; i < n; i++) smax(m, a[i - 1] - a[i] - c);
printf("%d", m);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, c, ar[100], t, ans = 0;
scanf("%d %d", &n, &c);
for (int i = 0; i < n; ++i) scanf("%d", &ar[i]);
for (int i = 0; i < n - 1; ++i) {
t = ar[i] - ar[i + 1] - c;
if (t > ans) ans = t;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, arr[150];
int i, max = -10000000;
cin >> n >> c;
for (i = 0; i < n; i++) cin >> arr[i];
for (i = 0; i < n - 1; i++) {
if (arr[i] - arr[i + 1] - c > max) {
max = arr[i] - arr[i + 1] - c;
}
}
if (max <= 0)
cout << 0 << endl;
else
cout << max << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void R__Extend_Euclid(long long a, long long b, long long &d, long long &x,
long long &y) {
if (!b) {
x = 1, y = 0, d = a;
} else
R__Extend_Euclid(b, a % b, d, y, x), y -= (a / b) * x;
}
template <class R>
string R__MonthName(R name) {
string mon[15];
mon[1] = "January";
mon[2] = "February";
mon[3] = "March";
mon[4] = "April";
mon[5] = "May";
mon[6] = "June";
mon[7] = "July";
mon[8] = "August";
mon[9] = "September";
mon[10] = "October";
mon[11] = "November";
mon[12] = "December";
return mon[name];
}
template <class R>
R R__MonthDay(R num) {
R month[13];
month[1] = 31;
month[2] = 28;
month[3] = 31;
month[4] = 30;
month[5] = 31;
month[6] = 30;
month[7] = 31;
month[8] = 31;
month[9] = 30;
month[10] = 31;
month[11] = 30;
month[12] = 31;
return month[num];
}
template <class R>
R R__GCD(R a, R b) {
if (a == 0 && b == 0) return 0;
if (a == 0) return 1;
if (b == 0)
return a;
else
return R__GCD(b, a % b);
}
template <class R>
R R__LCM(R a, R b) {
return (a * b) / R__GCD(a, b);
}
int main() {
int n, c, ans = 0;
cin >> n >> c;
vector<int> in;
while (n--) {
int x;
cin >> x;
in.push_back(x);
}
for (int i = 1; i < in.size(); i++) {
int temp = in[i - 1] - in[i] - c;
if (temp > ans) ans = temp;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, c, a[200], max1 = 0, i;
cin >> n >> c;
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < n - 1; i++)
if (a[i] - a[i + 1] > max1) max1 = a[i] - a[i + 1];
cout << max(0LL, max1 - c) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[110], b[110], ans, i, n, c;
int main() {
scanf("%d%d", &n, &c);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i <= n - 1; i++) {
b[i] = a[i] - a[i + 1];
}
for (i = 1; i <= n - 1; i++) {
ans = max(ans, b[i]);
}
ans -= c;
if (ans < 0) {
printf("0");
} else {
printf("%d", ans);
}
}
|
#include <bits/stdc++.h>
int main() {
int n, c, x[101], i, max = 0, k = -1;
scanf("%d %d", &n, &c);
for (i = 0; i < n; i++) {
scanf("%d", &x[i]);
if (i > 0) {
if (x[i - 1] - x[i] - c > max) {
max = x[i - 1] - x[i] - c;
k = i;
}
}
}
max > 0 ? printf("%d\n", max) : printf("0\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v(100);
int n, c;
cin >> n >> c;
for (int i = 0; i < n; i++) cin >> v[i];
int ans = 0;
for (int i = 0; i < n - 1; i++) ans = max(ans, v[i] - c - v[i + 1]);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int compareAscending(const void *a, const void *b) {
return (*(int *)a - *(int *)b);
}
int compareDecending(const void *a, const void *b) {
return (*(int *)b - *(int *)a);
}
int compareFirst(const void *a, const void *b) {
if (((pair<int, int> *)a)->first == ((pair<int, int> *)b)->first)
return ((pair<int, int> *)a)->second - ((pair<int, int> *)b)->second;
else
return ((pair<int, int> *)a)->first - ((pair<int, int> *)b)->first;
}
int compareSecond(const void *a, const void *b) {
if (((pair<int, int> *)a)->second == ((pair<int, int> *)b)->second)
return ((pair<int, int> *)a)->first - ((pair<int, int> *)b)->first;
else
return ((pair<int, int> *)a)->second - ((pair<int, int> *)b)->second;
}
bool isPrime(int a) {
if (a < 2) return false;
if (a < 4) return true;
if (a % 2 == 0) return false;
int s = (int)sqrt(a);
for (int i = 3; i <= s; i += 2) {
if (a % i == 0) return false;
}
return true;
}
int bsearch(int *a, int value, int l, int r) {
if (l == r) return l;
if (l + 1 == r) return a[l] > value ? l : r;
int m = (l + r) / 2;
if (a[m] > value)
return bsearch(a, value, l, m);
else
return bsearch(a, value, m + 1, r);
}
int ucln(int a, int b) {
if (a % b == 0)
return b;
else
return ucln(b, a % b);
}
int main() {
int n, c, pre, res = 0, t;
scanf("%d %d %d", &n, &c, &pre);
for (int i = 1; i < n; i++) {
scanf("%d", &t);
res = max(res, pre - t - c);
pre = t;
}
printf("%d", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, c, x[112], ans;
int main(int argc, char const *argv[]) {
scanf("%d %d", &n, &c);
for (int i = 0; i < n; i++) scanf("%d", &x[i]);
for (int i = 0; i < n - 1; i++) {
ans = max(ans, x[i] - x[i + 1] - c);
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, max = 0, m, l = 0, o;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> m;
o = l - m;
if (o > max) max = o;
l = m;
}
if ((max - k) < 0) {
max = 0;
k = 0;
}
cout << (max - k);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
auto info = vector<int>(n);
for (int x = 0; x < n; x++) cin >> info[x];
int Max = 0;
for (int x = 0; x < n - 1; x++) {
int profit = (info[x] - info[x + 1] - c);
Max = max(Max, profit);
}
cout << Max << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int c;
cin >> n >> c;
int max(0);
int x[n];
for (int i = 0; i < n; i++) cin >> x[i];
for (int i = 0; i < n - 1; i++) {
int s(0);
s += x[i];
s -= x[i + 1];
s -= c;
if (s > max) max = s;
}
cout << max << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI =
3.14159265358979323846264338327950288419716939937510582097494459230;
void swaps(char *x, char *y) {
char temp;
temp = *x;
*x = *y;
*y = temp;
}
void swapi(int *a, int *b) {
int temp;
temp = *a;
*a = *b;
*b = temp;
}
unsigned long long gcd(unsigned long long a, unsigned long long b) {
if (a == 0) return b;
if (b == 0) return a;
if (a == 1 || b == 1) return 1;
if (a == b) return a;
if (a > b)
return gcd(b, a % b);
else
return gcd(a, b % a);
}
int X[101];
int main() {
int Cases = 1;
for (int Case = 0; Case < Cases; Case++) {
int N, Req;
cin >> N >> Req;
int Ans = 0;
for (int i = 0; i < N; i++) cin >> X[i];
for (int i = 0; i < N - 1; i++) {
Ans = max(Ans, X[i] - X[i + 1] - Req);
}
cout << Ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
cin >> n >> c;
int p[n], pr[n - 1];
for (int i = 0; i < n; i++) {
cin >> p[i];
if (i > 0) pr[i - 1] = p[i - 1] - p[i] - c;
}
int max = 0;
for (int i = 0; i < n - 1; i++) {
if (max <= pr[i]) {
max = pr[i];
}
}
cout << max << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, c;
cin >> n >> c;
int a[120];
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < n - 1; ++i) a[i] -= a[i + 1];
int rt = 0;
for (int i = 0; i < n - 1; ++i) rt = max(rt, a[i]);
rt = max(rt - c, 0);
cout << rt << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n];
int maxx = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i - 1] - a[i] - m > maxx && i > 1) {
maxx = a[i - 1] - a[i] - m;
}
}
cout << maxx << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int ret = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -f;
ch = getchar();
}
while (ch >= '0' && ch <= '9') ret = ret * 10 + ch - '0', ch = getchar();
return ret * f;
}
int main(int argc, char* argv[]) {
int nNumberCount;
int nNumberC;
int nNumberArrays[110];
int nSumArrays[110];
int nMaxNumber = INT_MIN;
cin >> nNumberCount >> nNumberC;
for (int i = 1; i <= nNumberCount; i++) {
cin >> nNumberArrays[i];
nSumArrays[i - 1] = nNumberArrays[i - 1] - nNumberArrays[i];
}
for (int i = 1; i < nNumberCount; i++) {
nMaxNumber = max(nMaxNumber, nSumArrays[i]);
}
cout << max(nMaxNumber - nNumberC, 0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, i;
int x[102];
cin >> n >> c;
for (i = 0; i < n; i++) cin >> x[i];
vector<int> l;
for (i = 0; i < n - 1; i++) {
int temp = x[i] - x[i + 1] - c;
if (temp <= 0)
l.push_back(0);
else
l.push_back(temp);
}
sort(l.begin(), l.end());
cout << l.back() << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.