Submission #15794

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
15794	2015-07-28 16:35:15	conankun	Split the sequence (APIO14_sequence)	C++98	100 / 100	975 ms	92424 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>
#include<vector>
#include<algorithm>
typedef long long ll;
using namespace std;
ll S[111111];
ll D[2][111111];
int bt[202][111111];
int N, K;
int qu[111111];
int main() {
  cin.sync_with_stdio(false);
  cout.sync_with_stdio(false);
  cin >> N >> K;
  int i,j, k;
  for (i = 1; i <= N; i++) {
    cin >> S[i];
    S[i] += S[i - 1];
  }
  for (k = 1; k <= K; k++) {
    int s = 1, e = 0, kg = k % 2, a=0,b=0;
    double gg=0,gg2=0;
    for (i = 1; i <= N; i++) {
      for (j = s; j <= e-1; j++) {
        a = qu[j], b = qu[j+1];
        if(S[a] == S[b])gg=0;
        else gg=(double)(D[1-kg][b] - D[1-kg][a] - S[b] * S[b] + S[a] * S[a]) / (S[a]-S[b]);
        if (gg <= S[i]) s++;
        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