Project_Euler-08 题解

Project_Euler-08 题解

题目

题目中给出的数据如下：

73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 85861560789112949495459501737958331952853208805511 12540698747158523863050715693290963295227443043557 66896648950445244523161731856403098711121722383113 62229893423380308135336276614282806444486645238749 30358907296290491560440772390713810515859307960866 70172427121883998797908792274921901699720888093776 65727333001053367881220235421809751254540594752243 52584907711670556013604839586446706324415722155397 53697817977846174064955149290862569321978468622482 83972241375657056057490261407972968652414535100474 82166370484403199890008895243450658541227588666881 16427171479924442928230863465674813919123162824586 17866458359124566529476545682848912883142607690042 24219022671055626321111109370544217506941658960408 07198403850962455444362981230987879927244284909188 84580156166097919133875499200524063689912560717606 05886116467109405077541002256983155200055935729725 71636269561882670428252483600823257530420752963450

存在空格，不存在换行符

思路

题目要求求出连续 $13$ 个数的最大乘积，因此要求我们维护一个包含 $n$ 个元素的窗口(这里的 $n$ 是 $13$)，从头向后扫描，每次记录下每个窗口的积，再维护一个最大值，每次比较大小取大者。

本文的代码使用了一种自定义 $n$ 值的方式，但是仍然不能让 $n$ 值过大，否则 $longlong$ 类型也承载不下，使用getchar作为读入文本的方式。

代码

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <time.h>
#define ll long long
#define MAX_N 10000

char a[MAX_N];

ll solve(int n) {
    int len = 1;
    char t;
    while((t = getchar()) != EOF) {
        if (t == '\n' || t == '\0') continue;
        if (t <= '9' && t >= '0') a[len++] = t;
        else continue;
    }
    printf("len = %d\n", len - 1);

    int l = 1, r = 0;
    ll ans = 0, temp = 1;
    while(r < len) {
        ++r;
        if (a[r] == '0') {
            temp = 1;
            l = r + 1;
            continue;
        } else temp *= (a[r] - '0');
        printf("a[r] = %d, ans = %lld, temp = %lld\n", a[r] - '0', ans, temp);
        if (r - l >= n) {
            temp /= (a[l++] - '0');
        }
        if (ans < temp) ans = temp;
    }
    return ans;
}

int main() {
    ll ans;
    int len, n;
    scanf("%d", &n);
    ans = solve(n);
    printf("%lld\n", ans);
    return 0;
}