csdn第40期周赛
整体难度不高,但是题目描述比较迷人
小鱼的航程(改进版)
给定初始星期,然后周末休息,问n天后,会多少进度,直接/7,然后对%7的值进行处理就行
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#define int long long
int solution(int x, int n)
{
int result = n / 7 * 250 * 5;
int m = n % 7;
for (int i = x; i < x + m; i++)
{
if (i % 7 == 0 || i % 7 == 6)
continue;
else
result += 250;
}
return result;
}
signed main()
{
int x;
int n;
std::cin >> x;
std::cin >> n;
int result = solution(x, n);
std::cout << result << std::endl;
return 0;
}
编码 好题!!!
字母表中共有26个字母{a,b,…,z},这些特殊的单词长度不超过6且字母按升序排列。把所有这样的长度相同的单词放在一起,按字典顺序排列,一个单词的编码就对应着它在整个序列中的位置。
比较好的一个题目,利用递推的性质进行处理
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
using namespace std;
int a[100][30];
int num;
int solution(string s)
{
int ans = 0;
if (s.size() > 6)
{
return 0;
}
for (int i = 0; i < s.size(); i++)
if (s[i] < 'a' || s[i] > 'z' || s[i - 1] >= s[i])
return 0;
for (int i = 1; i <= 26; i++)
a[i][1] = 1;
for (int j = 2; j <= 6; j++)
for (int i = 27 - j; i >= 0; i--)
a[i][j] = a[i + 1][j - 1] + a[i + 1][j];
for (int j = s.size() - 1; j >= 0; j--)
{
num++;
for (int i = 1; i <= s[j] - 'a' + 1; i++)
ans += a[i][num];
}
return ans;
}
int main()
{
string word;
getline(cin, word);
int result = solution(word);
cout << result << endl;
return 0;
}
一维数组的最大子数组和
没有通过,感觉数据存在问题,对于多个解,没有定义具体答案
喜水青蛙
河道长度为L。随机分布着m块石头。青蛙的最小跳跃距离是s,最大跳跃距离是t。
青蛙想要尽可能的少踩石头,那么它通过河道最少会踩到多少石头
直接dp上就行,比较简单
#include <iostream>
#include <cstring>
#include <sstream>
#include <vector>
#include <algorithm>
using namespace std;
int w[100000], f[100000], stones[110];
int L;
int s;
int t;
int m;
int solve()
{
int ans = 0;
if (s == t)
{
for (int i = 1; i <= m; i++)
{
if (stones[i] % s == 0)
ans++;
}
}
else
{
int last = 0;
sort(stones + 1, stones + 1 + m);
for (int i = 1; i <= m; i++)
{
int diff = min(stones[i] - last, 100);
last = stones[i];
stones[i] = stones[i - 1] + diff;
}
for (int i = 1; i <= m; i++)
w[stones[i]] = 1;
memset(f, 0x3f, sizeof f);
f[0] = 0;
for (int i = s; i < stones[m] + 10; i++)
{
for (int j = i - t; j <= i - s; j++)
{
if (j < 0)
continue;
f[i] = min(f[i], f[j] + w[i]);
}
}
ans = 100;
for (int i = stones[m]; i <= stones[m] + 10; i++)
ans = min(ans, f[i]);
}
return ans;
}
int main()
{
cin >> L >> s >> t >> m;
for (int i = 1; i <= m; i++)
{
cin >> stones[i];
}
cout << solve();
return 0;
}