# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
833782 | rainboy | Discharging (NOI20_discharging) | C11 | 100 ms | 18364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#define N 1000000
typedef long double ld;
int min(int a, int b) { return a < b ? a : b; }
int ii[N]; long long dp[N + 1];
ld cross(int i, int j, int k) {
return (ld) (ii[j] - ii[i]) * (dp[k] - dp[i]) - (ld) (ii[k] - ii[i]) * (dp[j] - dp[i]);
}
long long eval(int i, int a) {
return dp[i] - (long long) ii[i] * a;
}
int main() {
static int aa[N], qu[N];
int n, n_, cnt, h, i, i_, a;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &aa[i]);
n_ = 0;
for (i = 0, i_ = -1; i < n; i++)
if (i_ == -1 || aa[i_] < aa[i])
ii[n_++] = i, i_ = i;
cnt = 0;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |