| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 19170 | 季洁 | 房屋积水 | C++ | Accepted | 100 | 0 MS | 264 KB | 489 | 2021-05-09 20:40:32 |
#include<bits/stdc++.h> using namespace std; int n,r; int a[105],lmax[105],rmax[105],ans; int main(){ scanf("%d %d",&n,&r); a[1]=r%10; for(int i=2;i<=n;i++){ r=(r*6807%201701+2831)%201701; a[i]=r%10; } for (int i=1;i<=n;i++){ lmax[i]=max(lmax[i-1],a[i]); } for(int i=n;i>=1;i--) rmax[i]=max(rmax[i+1],a[i]); int ans=0; for(int i=2;i<n;i++){ int t=min(lmax[i-1],rmax[i+1]); if(a[i]>=t) continue; ans+=t-a[i]; } printf("%d\n",ans); return 0; }