欢乐纪中某A组赛【2019.7.6】

前言

斐大爷 $N B$

成绩

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

$R a n k$	$P e r s o n$	$S c o r e$	$A$	$B$	$C$
$5$	$(J - 2) W Y C$	$210$	$100$	$100$	$10$
$6$	$(J - 3) Z Z Y$	$200$	$100$	$100$	$0$
$6$	$(J - 3) W H F$	$200$	$100$	$100$	$0$
$29$	$(J - 2) X X Y$	$100$	$100$	$0$	$0$
$46$	$(J - 2) H Z B$	$60$	$50$	$0$	$10$
$46$	$(J - 3) Q Y H$	$60$	$10$	$0$	$50$
$51$	$(J - 2) L W$	$50$	$40$	$10$	$0$
$51$	$(J - 2) Z Y C$	$50$	$50$	$0$	$0$
$51$	$(J - 2) L R Z$	$50$	$30$	$20$	$0$
$55$	$(J - 2) X J Q$	$40$	$30$	$10$	$0$
$55$	$(J - 2) H J Q$	$40$	$40$	$0$	$0$

正题

$T 1 : j z o j 2679 -$ 跨时代【背包 $, d f s,$ 状压】

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

$T 2 : P 2579, j z o j 2288 - [Z J O I 2005]$ 沼泽鳄鱼【矩阵乘法】

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

$T 3 : P 4130, j z o j 1214 - [N O I 2007]$ 项链工厂【线段树】

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

$someofcodesome\ of\ code$

$T210T2\ 10$ 分 $c o d e$

#include<cstdio>
#include<algorithm>
using namespace std;
const int N=1100;
int n,C,c[N],q,nes[N];
int ask(int x,int y,bool flag)
{int i=x,last=0,ans=0;for(int i=x;i!=y;i=(i%n)+1){if(c[i]!=last) ans++;last=c[i];}if(c[i]!=last)ans++;if(flag&&c[1]==c[n]&&ans!=1) ans--;return ans;
}
int main()
{scanf("%d%d",&n,&C);for(int i=1;i<=n;i++)scanf("%d",&c[i]);scanf("%d",&q);for(int i=1;i<=q;i++){char op[5];int x,y,z;scanf("%s",op);if(op[0]=='C'&&op[1]=='S'){scanf("%d%d",&x,&y);printf("%d\n",ask(x,y,0));}else if(op[0]=='C')printf("%d\n",ask(1,n,1));if(op[0]=='R'){scanf("%d",&x);for(int i=1;i<=n;i++)nes[(x+i-1)%n+1]=c[i];for(int i=1;i<=n;i++)c[i]=nes[i];}if(op[0]=='F')for(int i=2;i<n-i+2;i++)swap(c[i],c[n-i+2]);if(op[0]=='S'){scanf("%d%d",&x,&y);swap(c[x],c[y]);}if(op[0]=='P'){scanf("%d%d%d",&x,&y,&z);for(int i=x;i!=y;i=(i%n)+1)c[i]=z;c[y]=z;}}
}