争取三天做完一套吧,太简单的就写一句话题解吧(其实也没多少会做的)。
自己做出来的在前面用*标记
暴力dfs即可,直接判断个数
https://cloud.tencent.com/developer/article/1350465
https://cloud.tencent.com/developer/article/1350468
结论题。
#include<cstdio>
#include<iostream>
#define LL long long
using namespace std;
main() {
LL N, A, B;
cin >> N >> A >> B;
cout << max((LL)0, (N - 1) * B + A - (N - 1) * A - B + 1);
return 0;
}
大力特判
#include<cstdio>
#include<iostream>
#include<cstring>
#define LL long long
using namespace std;
const int MAXN = 1e5 + 10;
char s[MAXN];
main() {
scanf("%s", s + 1);
int N = strlen(s + 1);
LL ans = 0;
for(int i = 1; i <= N; i++) {
if(s[i] == 'U') ans += (N - i) + (i - 1) * 2;
else ans += (N - i) * 2 + (i - 1);
}
cout << ans;
return 0;
}
https://cloud.tencent.com/developer/article/1345721
https://cloud.tencent.com/developer/article/1345634
https://cloud.tencent.com/developer/article/1345717
https://cloud.tencent.com/developer/article/1345718
https://cloud.tencent.com/developer/article/1345721