前言

六一儿童节快乐(然而我还在学校)
dalao都走了，导致只剩下我们这帮菜鸡在被虐

---

成绩

$J$表示初中，$H$表示高中后面加的是几年级

$Rank$	$Person$	$Score$	$A$	$B$	$C$
$1$	$(J-2)ZYC$	$130$	$30$	$100$	$0$
$2$	$(J-2)XXY$	$120$	$0$	$100$	$20$
$3$	$(J-2)juruo$	$115$	$15$	$100$	$0$
$4$	$(J-2)XJQ$	$100$	$0$	$100$	$0$
$10$	$(H-1)HJW$	$30$	$30$	$0$	$0$
$10$	$(J-2)LW$	$30$	$30$	$0$	$0$
$15$	$(H-2)YDW$	$10$	$0$	$10$	$0$

---

正题

---

$T1:jzoj6191-[NOI2019$模拟$2019.5.31]Exchange$【线段树】

链接:
https://blog.csdn.net/Mr_wuyongcong/article/details/90729923

---

$T2:jzoj4802-[GDOI2017$模拟$9.24]$探险计划【费用流$,$拆点】

链接:
https://blog.csdn.net/Mr_wuyongcong/article/details/90729059

---

$T3:jzoj4800-[GDOI2017$模拟$9.24]$周末晚会【$dp,$循环重构】

链接:
https://blog.csdn.net/Mr_wuyongcong/article/details/90729059

---

$someofcodes$

---

T115分code

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=2e6;
int n,m,val[N],next[N],f[N],ans;
int main()
{freopen("exchange.in","r",stdin);freopen("exchange.out","w",stdout);scanf("%d%d",&n,&m);for(int i=1;i<=n;i++)scanf("%d",&val[i]);for(int i=n;i>=1;i--)for(int j=i;j<=n;j++)if(val[j]>val[i]){next[i]=j;break;}for(int i=1;i<=m;i++){int l,r;ans=0;scanf("%d%d",&l,&r);memset(f,0,sizeof(f));for(int i=l;i<=r;i++){f[next[i]]=max(f[next[i]],f[i]+1);ans=max(ans,f[i]+1);}printf("%d\n",ans);}
}

---

总结

看题期望分$$70+100+0=170$$
做题期望分$$30+100+0=130$$
实际の分数$$15+100+0=115$$
$T2$直接裸的网络流切掉，然后死刚$T1$，然后有些思路(事后发现是正解的一部分)结果没写出来就写了个$O(n^2)$暴力结果蜜汁$TLE???$

---

$$\text{:<}$$

最后的最后
$$\begin{array}{c}菜\\ \text{vegetable}\end{array}$$