A:切题太少,不知道性质,本想拿着矩阵快速幂板子套着大数改改。。。
#include <bits/stdc++.h>
using namespace std;
string s;
int main()
{
cin >> s;
if((s[s.length() - 1] - '0') & 1) printf("-1\n");
else puts("1");
return 0;
}
B:Ctrl+c,不说了.
……
C:我感觉我的方法还不错,应该比nlog^2要快一点。
对于sum/k我直接暴力,最多也就2^7个因子,然后把k用map标记一下暴力的答案,方便重复查询,当然也可以提前打表处理,对于本题不打表也可以的.(我觉得这是一种做这类题的一个暴力方法,标记查询的答案)
#pragma GCC optimize ("O3")
#pragma GCC optimize ("O2")
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <unordered_map>
using namespace std;
template <class T> inline void scan_d(T &ret) {
char c; ret = 0;
while ((c = getchar()) < '0' || c > '9');
while (c >= '0' && c <= '9') {
ret = ret * 10 + (c - '0'), c = getchar();}}
typedef long long LL;
LL a[100010];
unordered_map<LL, int> mp1;
unordered_map<LL, int> mp2;
int main() {
int n, q; LL sum = 0, k;
scanf("%d %d", &n, &q);
for(int i = 1; i <= n; ++i) {
scan_d(a[i]);
sum += a[i];
mp1[sum] = 1;
}
while(q--) {
scanf("%lld", &k);
if(sum % k) puts("No");
else {
if(!mp1[sum / k]) puts("No");
else if(mp2[k] == 1) puts("Yes");
else if(mp2[k] == 2) puts("No");
else {
LL res = 0, ans = 0, cnt = sum / k;
for(int i = 1; i <= n; ++i) {
res += a[i];
if(res == cnt) {
res = 0;
ans++;
}
}
if(ans == k) {
mp2[k] = 1;
puts("Yes");
} else {
mp2[k] = 2;
puts("No");
}
}
}
}
return 0;
}
D:建个图,直接dfs跑树的直径就可以.
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long LL;
const int MAXN = 5e4 + 10;
vector<pii> G[MAXN];
int ans = 0, id = -1;
inline void dfs(int x, int fa, int len, int s) {
if(len > ans) {
ans = len;
id = x;
}
for(int i = 0; i < G[x].size(); ++i) {
pii u = G[x][i];
if(u.first == fa) continue;
int res = u.second * (s + 19 + s + u.second) / 2;
dfs(u.first, x, len + res, s + u.second);
}
}
int main() {
int n, a, b, c;
scanf("%d", &n);
for(int i = 1; i < n; ++i) {
scanf("%d %d %d", &a, &b, &c);
G[a].push_back(make_pair(b, c));
G[b].push_back(make_pair(a, c));
}
dfs(1, -1, 0, 1);
dfs(id, -1, 0, 1);
printf("%d\n", ans);
return 0;
}
E:最长非严格递增子序列nlogn,直接写.
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long LL;
const int MAXN = 5e4 + 10;
int dp[MAXN], a[MAXN];
int main() {
int n;
scanf("%d", &n);
for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
int res = 1; dp[0] = a[1];
for(int i = 2; i <= n; ++i) {
int cnt = upper_bound(dp, dp + res, a[i]) - dp;
if(a[i] >= dp[res - 1]) dp[res++] = a[i];
else dp[cnt] = a[i];
}
printf("%d\n", res);
return 0;
}
F:待补。。。