丁一的博客

#include<iostream> #include<vector>#include<cmath>using namespace std;int main(){ int n; scanf("%d",&n); vector<int> forward(n+1,0),backward(n+1,0),input(n+1,0); f...

#include<iostream>#include<cmath>const int mod=1000000007;using namespace std;long long int base[100005];void init(){ long long int res=0; for(int i=1;i<100005-1;i++) ...

编号 题目 考点 1017 The Best Peak Shape 动态规划 1018 Subnumbers 找规律