# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19173 | mindol | Split the sequence (APIO14_sequence) | C++14 | 0 ms | 131072 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<cstdio>
#include<deque>
#include<algorithm>
#include<stack>
using namespace std;
int S[100001];
long long dp[100001][202];
int sel[100001][202];
struct pll{ long long first,second; int index; };
deque<pll> dq;
double crossX(pll p,pll q)
{
return ((double)q.second-p.second)/((double)p.first-q.first);
}
void push(long long a,long long b,int index) // ax+b
{
if(!dq.empty() && dq.back().first==a)
{
dq.back().second=max(dq.back().second,b);
return;
}
dq.push_back({a,b,index});
while(dq.size()>=3)
{
int sz=dq.size();
if(crossX(dq[sz-3],dq[sz-2])>crossX(dq[sz-3],dq[sz-1]))
dq[sz-2]=dq[sz-1], dq.pop_back();
else break;
# | 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... |