Submission #6890

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
6890	2014-07-09 06:27:18	qja0950	Split the sequence (APIO14_sequence)	C++98	100 / 100	668 ms	93500 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 MAXN 101101
#define MAXK 222
typedef long long ll;
int N, K;
int A[MAXN];
int S[MAXN];
void INPUT() {
  scanf("%d %d", &N, &K);
  for(int i=1; i<=N; i++) {
    scanf("%d", &A[i]);
    S[i]=S[i-1]+A[i];
  }
}
long long D[2][MAXN];
int Mom[MAXK][MAXN];
long long Stack[3][MAXN];
int Stackp;
bool MyOperator(ll Linea[], ll Lineb[]) {
  ll Line[3][2];
  for(int i=0; i<3; i++) {
    Line[i][0]=Linea[i];
    Line[i][1]=Lineb[i];
  }
  ll temp1=(ll)(Line[0][1]-Line[1][1])*(ll)(Line[2][0]-Line[1][0]);
  ll temp2=(ll)(Line[1][1]-Line[2][1])*(ll)(Line[1][0]-Line[0][0]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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