摘要： http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1163a[i - 1]表示i的前缀积，b[i + 1]表示i的后缀积，两者相乘取模就是所需的结果#include<cstdio>#define MAXN 100005int a[MAXN], b[MAXN];int n, m;int main(){ while(scanf( "%d%d", &n, &m) == 2){ for(int i = 0; i < n; i ++) scanf("%d",&a[i]); b 阅读全文

摘要： http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1165把F题想得太难了，用贪心的思想，找局部最优解，看了解题报告就A了。#include<cstdio>#include<cstring>#include<cstdlib>#define MAXD 1000005#define min(a, b) (a < b ? a : b)const long long inf = 0x7fffffff;int la, lb, lc;long long a[MAXD], b[MAXD], c[MAXD];long l 阅读全文