Sereja and Swaps（贪心+暴力枚举区间）

Sereja and Swaps

 AC_Code:

//枚举区间,o(n^2),然后将区间内最小的数逐个和区间外面最大的数交换
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 205;
const int inf=0x3f3f3f3f;
#define rep(i,first,last) for(int i=first;i<=last;i++)
#define dep(i,first,last) for(int i=first;i>=last;i--)
int n,k,a[maxn],b[maxn];

int solve(int l,int r){
    memcpy(b,a,sizeof(a));
    int ans=0;
    rep(i,l,r) ans+=a[i];
    int p,q;
    rep(i,1,k){
        int bMax=-inf,bMin=inf;
        rep(j,1,n){
            if((j<l||j>r)&&b[j]>bMax ){
                bMax=b[j];
                p=j;
            }
            else if( j>=l && j<=r && b[j]<bMin ){
                bMin=b[j];
                q=j;
            }
        }
        int t=bMax-bMin;
        if( t<=0 ) break;
        ans+=t;
        swap(b[p],b[q]);
    }
    return ans;
}
int main()
{
    scanf("%d%d",&n,&k);
    int ans=-inf;
    rep(i,1,n) scanf("%d",&a[i]);
    rep(i,1,n){
        rep(j,i,n){
            ans=max(ans,solve(i,j));
        }
    }
    printf("%d
",ans);
    return 0;
}