# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
294552 | nandonathaniel | Discharging (NOI20_discharging) | C++14 | 167 ms | 25848 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;
typedef long long LL;
typedef pair<LL,LL> pii;
const LL MAXN=1000005;
const LL INF=1e15;
vector<pii> line;
pii garis[MAXN];
pii tpot(pii satu,pii dua){
pii ret;
ret.first=satu.second-dua.second;
ret.second=dua.first-satu.first;
return ret;
}
bool great(pii x,pii y){
if(x.first/x.second<y.first/y.second)return true;
if(x.first/x.second>y.first/y.second)return false;
return (x.first%x.second)%y.second<=(y.first%y.second)*x.second;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
LL n,a,maxVal=0,last=0;
cin >> n;
garis[1]={-1,0}; //-i,dp[i-1]
for(LL i=1;i<=n;i++){
cin >> a;
if(a>=maxVal){
# | 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... |