제출 #8108

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
8108	2014-08-30 09:38:25	qja0950	수열 (APIO14_sequence)	C++98	0 / 100	0 ms	91524 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>
#define MAXK 222
#define MAXN 101101
typedef long long ll;
int N, K;
int Number[MAXN];
ll Sum[MAXN];
void INPUT() {
  scanf("%d %d", &N, &K);
  for(int i=1; i<=N; i++) {
    scanf("%d", &Number[i]);
    Sum[i] = Sum[i-1] + (ll)Number[i];
  }
}
int Mom[MAXK][MAXN];
ll Dy[2][MAXN];
void Get(int k, int a, int b, int ga, int gb) {
  if(a>b) return;
  int now  = k%2;
  int past = 1 - now;
  int m = (a + b)/2;
  ll max = -1;
  int maxp = 0;
  for(int i=ga; i<=gb; i++) {
    if(i>=m) break;
    ll current = Dy[past][i] + Sum[i]*(Sum[m] - Sum[i]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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