算法习题--蓝桥杯

python

cpp 复制代码
def read_log(filename):
    log = []
    with open(filename, 'r') as file:
        for line in file:
            correct_char, input_char, timestamp = line.split()
            log.append((correct_char, input_char, int(timestamp)))
    return log

def longest_combo(log):
    if len(log) <= 1:
        return len(log)

    max_combo = 1
    current_combo = 1

    for i in range(1, len(log)):
        if log[i][1] == log[i][0] and log[i][2] - log[i - 1][2] <= 1000:
            current_combo += 1
            if current_combo > max_combo:
                max_combo = current_combo
        else:
            current_combo = 1

    return max_combo

if __name__ == "__main__":
    filename = "log.txt"
    log = read_log(filename)
    result = longest_combo(log)
    print(result)

c

cpp 复制代码
#include <stdio.h>
#include <stdlib.h>

// 定义记录结构体
typedef struct {
    char correct_char;
    char input_char;
    long long timestamp;
} LogEntry;

// 读取日志文件
int read_log(const char *filename, LogEntry *log, int *n) {
    FILE *file = fopen(filename, "r");
    if (file == NULL) {
        return -1;
    }

    int count = 0;
    while (fscanf(file, "%c %c %lld\n", &log[count].correct_char, &log[count].input_char, &log[count].timestamp) == 3) {
        count++;
    }

    fclose(file);
    *n = count;
    return 0;
}

// 计算最长连击
int longest_combo(LogEntry *log, int n) {
    if (n <= 1) {
        return n;
    }

    int max_combo = 1;
    int current_combo = 1;

    for (int i = 1; i < n; i++) {
        if (log[i].input_char == log[i].correct_char && log[i].timestamp - log[i - 1].timestamp <= 1000) {
            current_combo++;
            if (current_combo > max_combo) {
                max_combo = current_combo;
            }
        } else {
            current_combo = 1;
        }
    }

    return max_combo;
}

int main() {
    const char *filename = "log.txt";
    LogEntry log[10000]; // 假设最多有10000条记录
    int n;

    if (read_log(filename, log, &n) != 0) {
        fprintf(stderr, "Error reading log file.\n");
        return 1;
    }

    int result = longest_combo(log, n);
    printf("%d\n", result);

    return 0;
}
相关推荐
快手技术40 分钟前
快手提出端到端生成式搜索框架 OneSearch,让搜索“一步到位”!
算法
CoovallyAIHub20 小时前
中科大DSAI Lab团队多篇论文入选ICCV 2025,推动三维视觉与泛化感知技术突破
深度学习·算法·计算机视觉
NAGNIP21 小时前
Serverless 架构下的大模型框架落地实践
算法·架构
moonlifesudo21 小时前
半开区间和开区间的两个二分模版
算法
moonlifesudo21 小时前
300:最长递增子序列
算法
CoovallyAIHub1 天前
港大&字节重磅发布DanceGRPO:突破视觉生成RLHF瓶颈,多项任务性能提升超180%!
深度学习·算法·计算机视觉
CoovallyAIHub1 天前
英伟达ViPE重磅发布!解决3D感知难题,SLAM+深度学习完美融合(附带数据集下载地址)
深度学习·算法·计算机视觉
聚客AI2 天前
🙋‍♀️Transformer训练与推理全流程:从输入处理到输出生成
人工智能·算法·llm
大怪v2 天前
前端:人工智能?我也会啊!来个花活,😎😎😎“自动驾驶”整起!
前端·javascript·算法
惯导马工2 天前
【论文导读】ORB-SLAM3:An Accurate Open-Source Library for Visual, Visual-Inertial and
深度学习·算法