赞美郎老师!
题目链接
https://codeforces.com/contest/1550
A 题意
一个序列合法当且仅当其除了1以外元素x都存在x-2或者x-1,给出n,问以n为sum的序列最短长度
A 思路
手玩一下发现答案单调,当且仅当1 3 5 7 9这种极限情况都无法处理时,才需要把答案加一,于是打表+二分就可以了。
A 代码
#include<cstdio>
#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<string>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<chrono>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl "\n"
#define int long long
//#define double long double
using namespace std;
typedef long long ll;
const int maxn=400505;
const int inf=0x3f3f3f3f;
int n,m,k,q;
int arr[maxn];
int pre[maxn];
vector<int>v;
void solve(){
cin>>n;
cout<<lower_bound(v.begin(),v.end(),n)-v.begin()+1<<endl;
}
signed main(){
IOS
#ifndef ONLINE_JUDGE
freopen("IO\\in.txt","r",stdin);
freopen("IO\\out.txt","w",stdout);
#endif
int tn=1;
cin>>tn;
int last=1;
v.push_back(1);
for(int i=3;i<maxn;i+=2){
v.push_back(last+i);
last+=i;
}
while(tn--){
solve();
}
}
B 题意
01串,给出ab,每次可以删除一个连续且全部为0或1的串,得分a*len+b,问最大得分
B 思路
易知a无影响,直接ans+=a*n。考虑b,如果b>=0,那么我们一点一点删是最好的,否则的话,我们应当尽量减少删除次数,那么我们记录连续1的块数为cnt1,连续0的块数为cnt0,显然删除次数是min(cnt0,cnt1)+1。
B 代码
#include<cstdio>
#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<string>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<chrono>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl "\n"
//#define int long long
//#define double long double
using namespace std;
typedef long long ll;
const int maxn=400505;
const int inf=0x3f3f3f3f;
int n,m,k,q;
int arr[maxn];
int a,b;
string s;
void solve(){
cin>>n>>a>>b>>s;
if(b>=0){
cout<<n*a+n*b<<endl;
return ;
}
n=s.size();
s='z'+s;
int ans=a*n;
int c1=0,c2=0;
char last=s[0];
for(int i=1;i<=n;i++){
if(last==s[i]) continue;
if(s[i]=='1'){
last='1';
c1++;
}
else{
last='0';
c2++;
}
}
ans+=b*(min(c1,c2)+1);
cout<<ans<<endl;
}
signed main(){
IOS
#ifndef ONLINE_JUDGE
freopen("IO\\in.txt","r",stdin);
freopen("IO\\out.txt","w",stdout);
#endif
int tn=1;
cin>>tn;
while(tn--){
solve();
}
}
C 题意
我们称三个二维点abc不好当且仅当d(a,b)+a(b,c)=d(a,c)。d为曼哈顿距离。我们称一个数列很棒当且仅当他不存在ijk,使得(ai,i)(aj,j)(ak,k)不好。问给出的序列有多少好的子序列,这里的子序列是连续的。
C 思路
自己太睿智了,推一下式子发现若子序列不好时,他存在abc使得abc严格不降或者严格不增。容易发现这样的子序列长度最长为4,暴力算就行了。
C 代码
#include<cstdio>
#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<string>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<chrono>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl "\n"
//#define int long long
//#define double long double
using namespace std;
typedef long long ll;
const int maxn=400505;
const int inf=0x3f3f3f3f;
int n,m,k,q;
int a[maxn];
int a1[maxn],a2[maxn];
deque<int>q1,q2;
void solve(){
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
int ans=n+n-1;
for(int i=1;i<n-1;i++){
if(a[i]<=a[i+1]&&a[i+1]<=a[i+2]) continue;
if(a[i]>=a[i+1]&&a[i+1]>=a[i+2]) continue;
ans++;
}
for(int i=1;i<n-2;i++){
if(a[i]<=a[i+1]&&a[i+1]<=a[i+2]) continue;
if(a[i]<=a[i+1]&&a[i+1]<=a[i+3]) continue;
if(a[i]<=a[i+2]&&a[i+2]<=a[i+3]) continue;
if(a[i+1]<=a[i+2]&&a[i+2]<=a[i+3]) continue;
if(a[i]>=a[i+1]&&a[i+1]>=a[i+2]) continue;
if(a[i]>=a[i+1]&&a[i+1]>=a[i+3]) continue;
if(a[i]>=a[i+2]&&a[i+2]>=a[i+3]) continue;
if(a[i+1]>=a[i+2]&&a[i+2]>=a[i+3]) continue;
ans++;
}
cout<<ans<<endl;
}
signed main(){
IOS
#ifndef ONLINE_JUDGE
freopen("IO\\in.txt","r",stdin);
freopen("IO\\out.txt","w",stdout);
#endif
int tn=1;
cin>>tn;
while(tn--){
solve();
}
}