QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#442426#8524. Weather Forecastucup-team2010#TL 188ms6992kbC++20889b2024-06-15 11:53:402024-06-15 11:53:41

Judging History

你现在查看的是最新测评结果

  • [2024-06-15 11:53:41]
  • 评测
  • 测评结果:TL
  • 用时:188ms
  • 内存:6992kb
  • [2024-06-15 11:53:40]
  • 提交

answer

#include <bits/stdc++.h>

using i64 = long long;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n, k;
    std::cin >> n >> k;

    std::vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> a[i];
    }

    std::vector<double> sum(n + 1, 0);
    for (int i = 0; i < n; ++i) {
        sum[i + 1] = sum[i] + a[i];
    }

    std::vector<std::vector<double>> dp(n + 1, std::vector<double>(k + 1, -1e9));
    dp[0][0] = 1e9;

    for (int j = 1; j <= k; ++j) {
        for (int i = j; i <= n; ++i) {
            for (int p = j - 1; p < i; ++p) {
                double avg = 1.0 * (sum[i] - sum[p]) / (i - p);
                dp[i][j] = std::max(dp[i][j], std::min(dp[p][j - 1], avg));
            }
        }
    }

    std::cout << std::fixed << std::setprecision(9) << dp[n][k];
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3812kb

input:

7 3
1 3 1 2 2 2 1

output:

1.666666667

result:

ok found '1.66667', expected '1.66667', error '0.00000'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3756kb

input:

1 1
1

output:

1.000000000

result:

ok found '1.00000', expected '1.00000', error '0.00000'

Test #3:

score: 0
Accepted
time: 0ms
memory: 4056kb

input:

2 1
2 1

output:

1.500000000

result:

ok found '1.50000', expected '1.50000', error '0.00000'

Test #4:

score: 0
Accepted
time: 0ms
memory: 3848kb

input:

3 2
2 4 4

output:

3.000000000

result:

ok found '3.00000', expected '3.00000', error '0.00000'

Test #5:

score: 0
Accepted
time: 0ms
memory: 3828kb

input:

4 2
6 7 3 12

output:

6.500000000

result:

ok found '6.50000', expected '6.50000', error '0.00000'

Test #6:

score: 0
Accepted
time: 0ms
memory: 3828kb

input:

5 3
17 23 13 12 21

output:

16.500000000

result:

ok found '16.50000', expected '16.50000', error '0.00000'

Test #7:

score: 0
Accepted
time: 0ms
memory: 3828kb

input:

7 4
3 37 46 23 46 6 31

output:

23.000000000

result:

ok found '23.00000', expected '23.00000', error '0.00000'

Test #8:

score: 0
Accepted
time: 0ms
memory: 3820kb

input:

10 5
30 91 36 53 74 91 37 1 76 3

output:

39.500000000

result:

ok found '39.50000', expected '39.50000', error '0.00000'

Test #9:

score: 0
Accepted
time: 0ms
memory: 3856kb

input:

100 50
593 336 577 842 505 78 665 825 990 895 952 782 721 242 421 951 786 994 238 154 356 483 686 143 220 473 920 353 738 690 96 915 913 157 412 882 465 585 963 635 68 72 901 143 50 558 310 504 987 97 588 987 841 829 780 497 758 909 503 585 91 657 912 870 663 606 748 492 175 92 375 768 773 206 676 8...

output:

483.000000000

result:

ok found '483.00000', expected '483.00000', error '0.00000'

Test #10:

score: 0
Accepted
time: 188ms
memory: 6992kb

input:

1000 500
74 796 330 98 801 45 160 90 432 788 873 109 714 307 407 94 360 136 198 912 744 902 549 398 478 590 663 983 956 267 201 332 610 249 698 268 700 755 902 485 327 539 203 397 721 971 951 378 674 159 269 182 473 993 84 832 808 908 73 608 842 411 465 886 348 153 924 871 729 1 279 949 475 71 982 3...

output:

395.000000000

result:

ok found '395.00000', expected '395.00000', error '0.00000'

Test #11:

score: -100
Time Limit Exceeded

input:

10000 5000
821 298 787 377 804 127 552 321 868 2 375 982 196 201 154 323 49 881 81 182 265 584 179 530 130 213 469 887 667 771 637 634 872 528 560 552 168 299 603 668 244 275 838 524 874 508 751 52 83 224 957 910 349 102 285 236 897 44 797 332 834 978 534 730 260 178 842 877 961 219 378 552 294 796 ...

output:


result: