还是自己太SB。卡水题卡半小时,呵呵。。。SB
A题链接:A
思路:第i个数与第j个数之和不等于第p个数和第q个数之和
(任意的j < i)(任意的p,q满足p < i && q < i && p != q)。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (100000+10)
#define MAXM (200000+10)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
using namespace std;
int ans[60];
int main()
{
int n;
while(Ri(n) != EOF)
{
if(n == 2)
{
printf("1 1\n");
continue;
}
ans[1] = 1;
for(int i = 2; i <= n; i++)
{
int sum = ans[i-1] + 1;
while(1)
{
bool flag = true;
for(int j = 1; j < i; j++)
{
for(int k = 1; k < i; k++)
{
if(k == j) continue;
for(int p = 1; p < i; p++)
{
if(ans[k] + ans[j] == sum + ans[p])
{
flag = false;
break;
}
}
if(!flag) break;
}
if(!flag) break;
}
if(flag) break;
sum++;
}
ans[i] = sum;
}
printf("%d", ans[1]);
for(int i = 2; i <= n; i++)
printf(" %d", ans[i]);
printf("\n");
}
return 0;
}
B题链接:B
思路:从最小链的开始,每次去掉一个圈来连接两个最长的链,一直模拟就好了。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (2000+10)
#define MAXM (200000+10)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
using namespace std;
int a[MAXN];
int main()
{
int n;
while(Ri(n) != EOF)
{
for(int i = 1; i <= n; i++)
Ri(a[i]);
if(n == 2)
{
Pi(1);
continue;
}
if(n == 1)
{
Pi(0);
continue;
}
sort(a+1, a+n+1); int num;
if(n == 4 || n == 3)
num = n - 2;
else
num = n - 3;
int ans = 0; int have = n;
for(int i = 1; i <= n; i++)
{
if(have - a[i] - 1 > 0)
{
have -= a[i];
ans += a[i];
have--;
}
else if(have <= 1) break;
else
{
int need = have - 2;
ans += need;
//Pi(need);
a[i] -= need;
if(a[i] > 0)
ans ++;
break;
}
if(have == 1)
break;
}
Pi(ans);
}
return 0;
}
C题链接:C
思路:贪心,首先必选1和3。由于1+3 = 4,从4继续找,下一位是9,因为1 3 9可以构成4 - 8,同理下一位是19,下下一位是39。。。因此只需每次求出选出数之和sum以及找到的下一位数next,一直找到sum大于n就好了。
推导next = sum + sum + 1,sum += next。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (100000+10)
#define MAXM (200000+10)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
using namespace std;
int main()
{
int n;
while(Ri(n) != EOF)
{
int ans = 1, next = 1, sum = 1;
while(sum < n)
{
ans++;
next = sum + sum + 1;
//Pi(next);
sum += next;
//Pi(sum);
}
Pi(ans);
}
return 0;
}
D题链接:D
就这题,还无脑WA一次。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (2000+10)
#define MAXM (200000+10)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
using namespace std;
int main()
{
int n;
while(Ri(n) != EOF)
{
LL Maxy = -1, Miny = INF, Maxx = -1, Minx = INF;
for(int i = 0; i < n; i++)
{
LL x, y;
Rl(x); Rl(y);
Maxx = max(x, Maxx);
Maxy = max(y, Maxy);
Minx = min(Minx, x);
Miny = min(Miny, y);
}
LL num = max(Maxx - Minx, Maxy - Miny);
Pl(num*num);
}
return 0;
}
真心不会,留坑待补。。。
F题链接:F
题意:给定n盏排成一排的灯,若第i盏灯是亮着的,那么你可以把第j盏灯打开(abs(i-j) <= 2)。给出初始亮着的灯编号m,问你有多少种方案数打开所有灯。
思路:组合数学。
假设存在第0盏灯,那么对于n盏灯,方案数ans[n] = ans[n-1] + ans[n-2] * (n-1).
1 1 -> 2 2 -> 3 4 -> 4 10 -> 5 18......这样我们可以把第0盏灯看做第一盏灯推导。设置dp[i][j]表示i盏灯第j盏是亮着的方案数,那么dp[i][1] = dp[i][i] = ans[i-1],dp[1][1] = 1。
将第j盏灯重复放置,考虑前面j盏和后面i-j+1盏这两个子问题dp[j][1] 和 dp[i-j+1][1],对于dp[j][1]的每一组可行解和dp[i-j+1][1]的每一组可行解,对应的组合方案数为C(i-1, j-1)。
dp[j][1]: 1 2 和 dp[i-j+1][1]: 3 4,两组方案的顺序已经定了,1和2,3和4不能交换顺序。
AC代码:注意取余
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (1000+10)
#define MAXM (200000+10)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while((a)--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
using namespace std;
LL dp[MAXN][MAXN], C[MAXN][MAXN], ans[MAXN];
void getdp()
{
for(int i = 0; i <= 1000; i++)
C[i][0] = 1LL;
for(int i = 1; i <= 1000; i++)
for(int j = 1; j <= i; j++)
C[i][j] = (C[i-1][j-1] + C[i-1][j]) % MOD;
ans[1] = 1LL; ans[2] = 1LL*2;
for(int i = 3; i <= 1000; i++)
ans[i] = (ans[i-1] + ans[i-2] *(i-1)) % MOD;
for(int i = 1; i <= 1000; i++)
{
if(i == 1) {dp[i][1] = 1; continue;}
for(int j = 1; j <= i; j++)
{
if(j == 1 || j == i)
dp[i][j] = ans[i-1];
else
dp[i][j] = dp[j][1] * dp[i-j+1][1] % MOD * C[i-1][j-1] % MOD;
}
}
}
int main()
{
getdp(); int n, m;
while(scanf("%d%d", &n, &m) != EOF)
{
Pl(dp[n][m]);
}
return 0;
}
G题链接:G
题意:给定n个数字a[](0-9),有m次查询。每次查询给定一个x,要求统计所有的b[y] = a[x] - a[y](y < x),记B1为所有>0的b[y]之和,记B2为所有<0的b[y]之和。若B1 > |B2| 输出"",若B1 = |B2|输出"",反之输出""。
思路:设置Max[i][k]为sigma(a[j]-k)其中(j<=i&&a[j]>=k),Min[i][k]为sigma(k-a[j])其中(j<=i&&a[j]<k)。
最后查询时比较Max[i-1][a[x]] Min[i-1][a[x]]就好了。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (100000+10)
#define MAXM (200000+10)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
using namespace std;
int a[MAXN], Max[MAXN][10], Min[MAXN][10];
char str[MAXN];
int main()
{
int n, m;
while(scanf("%d%d", &n, &m) != EOF)
{
CLR(Max, 0); CLR(Min, 0);
Rs(str);
for(int i = 0; i < n; i++)
a[i+1] = str[i] - '0';
for(int k = 0; k <= 9; k++)
{
for(int i = 1; i <= n; i++)
{
if(a[i] < k)
{
Max[i][k] = Max[i-1][k];
Min[i][k] = Min[i-1][k] + k - a[i];
}
else
{
Min[i][k] = Min[i-1][k];
Max[i][k] = Max[i-1][k] + a[i] - k;
}
}
}
W(m)
{
int x; Ri(x); int v = a[x];
if(Max[x-1][v] < Min[x-1][v])
printf("Keep some distance from me\n");
else if(Max[x-1][v] == Min[x-1][v])
printf("Next time\n");
else
printf("I agree\n");
}
}
return 0;
}
H题链接:H
没有时间看了,坑待补。。。
I题链接:I
题意:给定一个n*m的矩阵,每个元素代表该位置的财富值,要求财富值不能为负。每次可以由(i, j) -> (i+1, j) (i, j+1) (i+1, j+2) (i+2, j+1)4个位置。初始财富值为0,现在从(1, 1)出发,问可以收获的最大财富值。保证(1, 1)位置财富值为非负数。
思路:设置dp[i][j]为到达(i, j)获得的最大财富。O(n^2)转移就好了,注意不合法状态不能转移。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (1000+10)
#define MAXM (200000+10)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
using namespace std;
int dp[MAXN][MAXN], Map[MAXN][MAXN];
int n, m;
bool judge(int x, int y){
return x >= 1 && x <= n && y >= 1 && y <= m;
}
int main()
{
while(scanf("%d%d", &n, &m) != EOF)
{
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
Ri(Map[i][j]);
CLR(dp, -INF); int ans = 0;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
{
if(i == 1 && j == 1)
dp[i][j] = Map[i][j];
else if(i == 1)
{
if(dp[i][j-1] >= 0 && dp[i][j-1] + Map[i][j] >= 0)
dp[i][j] = dp[i][j-1] + Map[i][j];
}
else if(j == 1)
{
if(dp[i-1][j] >= 0 && dp[i-1][j] + Map[i][j])
dp[i][j] = dp[i-1][j] + Map[i][j];
}
else
{
if(dp[i][j-1] >= 0 && dp[i][j-1] + Map[i][j] >= 0)
dp[i][j] = max(dp[i][j], dp[i][j-1] + Map[i][j]);
if(dp[i-1][j] >= 0 && dp[i-1][j] + Map[i][j] >= 0)
dp[i][j] = max(dp[i][j], dp[i-1][j] + Map[i][j]);
int x = i - 1, y = j - 2;
if(judge(x, y) && dp[x][y] >= 0 && dp[x][y] + Map[i][j] >= 0)
dp[i][j] = max(dp[i][j], dp[x][y] + Map[i][j]);
x = i - 2, y = j - 1;
if(judge(x, y) && dp[x][y] >= 0 && dp[x][y] + Map[i][j] >= 0)
dp[i][j] = max(dp[i][j], dp[x][y] + Map[i][j]);
}
ans = max(ans, dp[i][j]);
}
}
Pi(ans);
}
return 0;
}
J题链接:J
题意:问你<=N的最大的p,使得p和p-4和p+4全是质数。
思路:只有一个7是合法的。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (2000+10)
#define MAXM (200000+10)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
using namespace std;
int main()
{
LL n;
while(Rl(n) != EOF)
{
LL ans = -1;
if(n >= 7)
ans = 7;
Pl(ans);
}
return 0;
}
K题链接:K
没时间读题。。。留坑待补。。。