A Blog

摘要： 简单题View Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio>using namespace std;#define maxn 100005int n, d;int f[maxn];int cal(int a){ int ret = 0; while (a > d) { ret += a / d; a = a / d + a % d; } return ret;}int main(){ //freopen("t.txt&qu 阅读全文

摘要： dpView Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio>using namespace std;#define maxn 10005int n, m;int value[maxn];int f[maxn];void input(){ scanf("%d%d", &m, &n); for (int i = 1; i <= n; i++) scanf("%d", &val 阅读全文

摘要： 二分+排序View Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;#define maxn 1005#define maxl 25struct Elem{ int id, quality, price;}elem[maxn];int n, budget;char name[maxn][maxl];int tot;bool vis[maxn];int 阅读全文

摘要： 最短路View Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio>using namespace std;#define maxn 605#define maxm 10005#define inf 0x3f3f3f3fstruct Edge{ int v, next, w;}edge[maxm * 2];int n, m;int id[maxn];int ecount, head[maxn];int lowcost[maxn];bool vis 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdlib>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;#define maxn 20005int n, m;int head[maxn], knight[maxn];void input(){ for (int i = 0; i < n; i++) scanf("%d", &head[i]); for (in 阅读全文