제출 #19174

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
19174	2016-02-19 11:48:01	mindol	수열 (APIO14_sequence)	C++14	100 / 100	1614 ms	83624 KiB

sequence

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<cstdio>
#include<deque>
#include<algorithm>
#include<stack>
using namespace std;
int S[100001];
long long dp[100001][2];
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;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 17 / 17
• Subtask 5: 21 / 21
• Subtask 6: 29 / 29