tlqtj
by 5t0_0r2 @ 2023-08-09 11:41:52
与我想法类似
我用vector记录每个方块位置
这是我代码
```cpp
#include <iostream>
//#include<cstdio>
//#include<cmath>
//#include<algorithm>
//#include<stdlib.h>
//#include<cstring>
//STL
//#include<string>
#include <vector>
//#include<queue>
//#include<list>
//#include<stack>
//#include<map>
//#include<bitset>
//#include<forward_list>
using namespace std;
typedef long long int ll;
constexpr int N=5e3+10,mod=998244353;
int n;
vector<short> a[N];
signed main() {
cin>>n;
for(int i=1;i<=n;++i){
int x;
scanf("%d",&x);
for(int j=1;j<=x;++j)
a[j].push_back(i);
}
int sum=0;
for(int i=1;i<=5000;++i){
if(a[i].empty())break;
for(int j=0;j<a[i].size()-1;++j)
sum+=a[i][j+1]-a[i][j]-1;
}
cout<<sum;
return 0;
}
```
[评测记录](https://www.luogu.com.cn/record/128342688)
by 2672434062xzl @ 2023-10-08 21:56:00