Deliver_的博客

#include <iostream>#include <assert.h>using namespace std;long f(long n){ long f1 = 1; long f2 = 1; long f3 = 0; if (n == 1 || n == 2) return 1; for (lo...

改变一下输出顺序就行了。#include <iostream>using namespace std;int matrix[205][205] = {0};int main(){ int m, n; cin >> m >> n; for (int i = 0; i < m; i++) { for...

动态规划思想，先解决一维的最大子段和，然后这道题可以将二维降到一维来做的。#include <iostream>#include <cstring>using namespace std;int MaxSubArray(int a[], int n){ int record[n]; record[0] = a[0]; for (int i...

只需要枚举a, b, c就足够了，d是可以通过a, b, c算出来的，少一层循环降低运行时间#include <iostream>#include <cmath>using namespace std;void spfh(int n){ for (int i = 0; i <= sqrt(n); i++) { for (in...