제출 #37609

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
37609	2017-12-26 11:57:16	mr_banana	수열 (APIO14_sequence)	C++14	0 / 100	0 ms	1840 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 <iostream>
#define int long long
using namespace std;
const int MN=1e5+10;
long long dp[2][MN];
int a[MN];
int ps[MN];
int dp2[MN][201];
long long sq(int x){
    return 1ll*x*x;
}
void solve(int d,int l,int r,int ol,int orr){
    if(l>=r){
        return ;
    }
    int mid=(l+r)/2;
    int o=ol;
    for(int i=ol;i<orr && i<mid;i++){
        int tmp=dp[1][mid];
        dp[1][mid]=max(dp[1][mid],dp[0][i]+1ll*(ps[mid+1]-ps[i+1])*ps[i+1]);
        if(dp[1][mid]>tmp){
            o=i;
        }
    }
    dp2[mid][d]=o;
    solve(d,l,mid,ol,o+1);
    solve(d,mid+1,r,o,orr);
}
int32_t main()
{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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