A - I AK NUISTCPC
嘀——过水已隐藏
B - Princess Connect! Re:Dive
嘀——过水已隐藏
C - idyllic 的书房
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
const int MAXN=2005;
const int INF=0x3f3f3f3f;
using namespace std;
int a[MAXN];
int ans[MAXN], cnt[MAXN];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for(int i=0;i<n;++i) {
for(int j=1;j<=m;++j) {
scanf("%d", &a[j]);
if(a[j]>a[j-1])cnt[j]++;
}
}
for(int j=1;j<=m;++j) {
if(cnt[j])ans[j]++,ans[m+1]--;
}
for(int j=1;j<=m;++j) {
ans[j]+=ans[j-1];
printf("%d ", ans[j]);
}
printf("\n");
return 0;
}
D - DD 的显示器
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
const int MAXN=3500;
const int INF=0x3f3f3f3f;
using namespace std;
int cnt[MAXN];
char l[5], r[5];
int f(char *s) {
int a=(s[0]-'0')*10+(s[1]-'0');
int b=(s[2]-'0')*10+(s[3]-'0');
return a*60+b;
}
int main() {
int T, n, k;
cin>>T;
while(T--) {
memset(cnt, 0, sizeof(cnt));
scanf("%d", &n);
for(int i=0