제출 #6983

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
6983	2014-07-12 04:20:41	woqja125	수열 (APIO14_sequence)	C++98	100 / 100	580 ms	86636 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<stdio.h>
int dat[100001], s[100001];
long long dp[2][100001];
long long Y[100001];
int p[210][100001];
int stk[100001], b;
inline bool cmp(long long *D, int z)
{
  int x, y;
  x = stk[b-1];
  y = stk[b];
  return (Y[y]-Y[x])*(s[y]-s[z]) >= (Y[z]-Y[y]) *(s[x]-s[y]);
}
int main()
{
  int n, k;
  int i, j, l;
  scanf("%d%d", &n, &k); k++;
  for(i=1; i<=n; i++)
  {
    scanf("%d", &dat[i]);
    s[i] = s[i-1] + dat[i];
  }
  for(i=0; i<=1; i++)for(j=0; j<=n; j++) dp[i][j]=-1;
  for(j=0; j<=n; j++)
  {
    dp[1][j] = 0;
  }
  for(i=2; i<=k; i++)
  {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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