A
枚举每一列,从左往右找即可
void solve()
{
int n,m;
cin >> n >> m;
for (int i = 1;i <= n;i++)
{
for (int j = 1;j <= m;j++)
cin >> arr[i][j];
}
int f = 0;
int f1 = 0,f2 = 0,f3 = 0,f4 = 0;
for (int i = 1;i <= m;i++)
{
for (int j = 1;j <= n;j++)
{
if(arr[j][i] == 'v' && !f1)
{
f1 = 1;
break;
}
if(arr[j][i] == 'i' && f1 && !f2)
{
f2 = 1;
break;
}
if(arr[j][i] == 'k' && f1 && f2 && !f3)
{
f3 = 1;
break;
}
if(arr[j][i] == 'a' && f1 && f2 && f3 && !f4)
{
f4 = 1;
break;
}
}
if(f4)
f = 1;
}
if(f)
cout << "YES" << '\n';
else
cout << "NO" << '\n';
}
B
观察修改后的数组,如果
a
i
a_i
ai >=
a
i
−
1
a_{i-1}
ai−1,我们不需要做任何操作,如果
a
i
a_i
ai <
a
i
−
1
a_{i-1}
ai−1,我们就插入一个
a
i
a_i
ai
void solve()
{
int n;
cin >> n;
for (int i = 1; i <= n;i++)
cin >> arr[i];
vector<int> ans;
ans.pb(arr[1]);
for (int i = 2;i <= n;i++)
{
if(arr[i] >= arr[i-1])
ans.pb(arr[i]);
else
{
ans.pb(arr[i]);
ans.pb(arr[i]);
}
}
cout << ans.size() << "\n";
for (auto it : ans)
cout << it << ' ';
cout << "\n";
}
C
一开始写了个差分,wa了之后发现数据范围1e9…
可以从右往左遍历,统计一下翻转之后矩形的高度,和有几个这个高度的矩形,和原数组对比即可
void solve()
{
int n;
cin >> n;
int f = 0;
for (int i = 1;i <= n;i++)
{
num[i] = num2[i] = 0;
cin >> arr[i];
}
if(n == 1)
{
if(arr[1] == 1)
cout << "YES" << "\n";
else
cout << "NO" << '\n';
return;
}
int a = 0;
int len = 0;
arr[0] = arr[1];
for (int i = 1;i <= n;i++)
{
if(arr[i] == arr[i-1])
len++;
else
{
num[++a] = len;
len = 1;
}
}
if(len != 1 || arr[n] != arr[n-1])
num[++a] = len;
num2[1] = arr[n];
int b = 1;
for (int i = n-1;i >= 1;i--)
{
if(arr[i] != arr[i+1])
num2[++b] = arr[i] - arr[i+1];
}
for (int i = 1;i <= a;i++)
{
if(num[i] != num2[i])
f = 1;
}
if(!f)
cout << "YES" << "\n";
else
cout << "NO" << "\n";
}
D
k个不同的冰淇淋的贡献是
k
∗
(
k
−
1
)
/
2
k*(k-1)/2
k∗(k−1)/2 可以先找出至少需要几个不同的冰淇淋,然后每多一个相同的冰淇淋,贡献就会加1,这样取是最优的,找冰淇淋的操作可以用二分实现
void solve()
{
ll n;
cin >> n;
ll l = 0,r = 1e10;
while(l + 1 != r)
{
ll mid = l + r >> 1;
if(mid * (mid-1)/2 <= n)
l = mid;
else
r = mid;
}
cout << n - l * (l-1)/2 + l << '\n';
}
E
可以发现损失的开心值只和最后一次看的电影有关,比如:
只看第5场电影的损失 :
5
∗
d
5*d
5∗d
看了第1,2,5场电影的损失 :
1
∗
d
+
1
∗
d
+
3
∗
d
=
5
∗
d
1*d + 1 * d + 3 * d = 5 * d
1∗d+1∗d+3∗d=5∗d
所以我们可以枚举最后看的电影是哪一场,然后选这场电影和它之前快乐值前m大的即可
void solve()
{
ll n,m,d;
priority_queue <int,vector<int>,greater<int> > q;
cin >> n >> m >> d;
for (int i = 1;i <= n;i++)
cin >> arr[i];
ll ma = 0;
ll sum = 0;
for (ll i = 1;i <= n;i++)
{
if(arr[i] > 0)
{
q.push(arr[i]);
sum += arr[i];
}
if(q.size() > m)
{
sum -= q.top();
q.pop();
}
ma = max(ma,sum - i*d);
}
cout << ma << "\n";
}
F
设怪物总生命值为sum,其中用水魔法击败的怪物生命值为x,答案就是对所有可能的x取
m
i
n
(
a
n
s
,
m
a
x
(
(
x
+
w
−
1
)
/
w
,
(
s
u
m
−
x
+
f
−
1
)
/
f
)
min(ans,max((x + w - 1)/w,(sum - x + f - 1) / f)
min(ans,max((x+w−1)/w,(sum−x+f−1)/f) 计算所有可能的x可以用bitset实现
void solve()
{
bit.reset();
ll w,f;
cin >> w >> f;
int n;
cin >> n;
ll sum = 0;
ll a;
bit[0] = 1;
for (int i = 1;i <= n;i++)
{
cin >> a;
bit |= bit << a;
sum += a;
}
ll ans = inf;
for (ll i = 0;i <= sum;i++)
{
if(bit[i])
{
ll tmp = sum - i;
ans = min(ans,max((i + w - 1)/w , (tmp + f - 1)/f));
}
}
cout << ans << '\n';
}