置换
mengbi_er
一个蒟蒻JLoier
展开
-
bzoj1119: [POI2009]SLO
这题跟bzoj1697一样的啊,可以水双倍经验啦。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;long long b[1000005],ans,c[1000005],w[1000005];bool vis[1000005];struct data{原创 2017-06-15 22:12:41 · 278 阅读 · 0 评论 -
1697: [Usaco2007 Feb]Cow Sorting牛排序
这道题置换群裸题,对于一个置换群,交换所需代价为sum+min((tot-2)群里最小值,(tot+1)群里最小值+最小数);#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;long long b[1000005],ans,c[1000005],w[10000原创 2017-06-15 22:08:53 · 392 阅读 · 0 评论 -
AIM Tech Round 4 (Div. 2) C. Sorting by Subsequences
题目大意每次选一个子序列,对它们进行排序,每个位置只能选1次,问最多选的次数。题解随便划一划就觉得是置换,然后就觉得很有道理,然后猜结论,然后xjb码一码,然后pp,然后ac。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ c原创 2017-08-25 08:23:07 · 448 阅读 · 0 评论