Codeforces Round #581 (Div. 2)-E. Natasha, Sasha and the Prefix Sums-动态规划+组合数学 [Problem Description] ​ 给你\(n\)个\(1\),\(m\)个\(-1\),他们任意排列有\(\frac{(n+m)!}{n!\cdot m!}\)中排列,每种排列都有一个最大前缀和(可能为\(0\)),求所有排列的最大前缀和之和为多少. [Solution] ​ 定义\(dp[i][j]\)表示有\(i\)个\(…
传送门 •参考资料 [1]:CF1204E Natasha, Sasha and the Prefix Sums(动态规划+组合数) •题意 由 n 个 1 和 m 个 -1 组成的 $C_{n+m}^{n}$ 个序列: 对所有序列的最大前缀和求和: 并规定最大前缀和最小是 0: •题解 定义 $(i,j)$ 表示序列由 i 个 1,j 个 -1 组成: $(i,j)$ 共有 $C_{i+j}^{i}$ 种不同的组合方式: $(i-1,j)$ 共有 $C_{i+j-1}^{i-1}$ 种不同的组…
It's one more school day now. Sasha doesn't like classes and is always bored at them. So, each day he invents some game and plays in it alone or with friends. Today he invented one simple game to play with Lena, with whom he shares a desk. The rules…
[Link]: [Description] [Solution] 傻逼题; 获取n/k; 对n/k的奇偶性讨论一下就好 [NumberOf WA] 0 [Reviw] [Code] #include <bits/stdc++.h> #define LL long long using namespace std; LL n,k; int main(){ //freopen("F:\\rush.txt","r",stdin); scanf("%l…
A:暴力. #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #define rep(i,l,r) for (int i=(l); i<=(r); i++) typedef long long ll; using namespace std;   ; int n; char s[N];   int main(){ scanf(); n=strlen(s+)…
题意:https://codeforc.es/problemset/problem/1204/D2 给你一个01串,如:0111001100111011101000,让你改这个串(使0尽可能多,任意 l~r 的LIS最长上升子序列长度不变). 问:0111001100111011101000 答:0011001100001011101000 思路: 参考题解:考虑什么串无法该变. 1. 10无法被改变(我们称为固定串),00,01,11都可以改. 2. 固定串+固定串(无法被改变). 3. 1+…
C. Anna, Svyatoslav and Maps time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output The main characters have been omitted to be short. You are given a directed unweighted graph without loops with n v…
D2. Kirk and a Binary String (hard version) time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output The only difference between easy and hard versions is the length of the string. You can hack this pro…
B. Mislove Has Lost an Array time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Mislove had an array a1, a2, ⋯, an of n positive integers, but he has lost it. He only remembers the following facts…
A. BowWow and the Timetable time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output In the city of Saint Petersburg, a day lasts for 2100 minutes. From the main station of Saint Petersburg, a train dep…