# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676496 | penguin133 | Global Warming (CEOI18_glo) | C++17 | 771 ms | 22648 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 <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
int P[300005], S[300005];
int n, x;
int A[300005], B[300005], C[300005];
int ft[300005];
void upd(int p, int v){
for(;p<=n;p+=(p & -p))ft[p] = max(ft[p], v);
}
int query(int p){
int res = 0;
for(;p;p-=(p & -p))res = max(res, ft[p]);
return res;
}
int32_t main(){
cin >> n >> x;
for(int i=1;i<=n;i++)cin >> A[i];
map<int, int> mp;
for(int i=1;i<=n;i++)C[i] = A[i];
sort(C+1, C+n+1);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |