Codeforces Round #243 (Div. 2) C. Sereja and Swaps
来源:互联网 发布:软件退税政策 编辑:程序博客网 时间:2024/06/05 09:55
枚举可能的区间,然后从区间内和区间外交换最小和最大的。
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>using namespace std ;int a[1010] ;int main(){ int n ,k; while(~scanf("%d %d",&n,&k)) { for(int i = 1 ; i <= n ; i++) scanf("%d",&a[i]) ; int maxx = -9999999,sum ; for(int i = 1 ; i <= n ; i++) { for(int j = i ; j <= n ; j++) { sum = 0 ; vector<int > v ,u; for(int h = i ; h <= j ; h++) { v.push_back(a[h]) ; sum += a[h] ; } maxx = max(maxx,sum) ; for(int h = 1 ; h <= n ; h++) { if(h < i || h > j) u.push_back(a[h]) ; } sort(v.begin(),v.end()) ; sort(u.begin(),u.end()) ; reverse(u.begin(),u.end()) ; for(int h = 1 ; h <= k && h <= v.size() && h <= u.size() ; h++)//枚举交换次数 { if(v[h-1] < u[h-1]) { sum -= v[h-1] ; sum += u[h-1] ; maxx = max(sum,maxx) ; } } } } printf("%d\n",maxx) ; } return 0 ;}
0 0
- Codeforces Round #243 (Div. 2) C. Sereja and Swaps
- Codeforces Round #243 (Div. 2) C. Sereja and Swaps
- Codeforces Round #243 (Div. 2)-C. Sereja and Swaps(multiset)
- Codeforces Round #243 (Div. 2)——Sereja and Swaps
- Codeforces Round #243 (Div. 2) C. Sereja and Swaps 解题报告
- Codeforces Round #243 (Div. 1) A Sereja and Swaps
- Codeforces Round #243 (Div. 1) C Sereja and Two Sequences
- CodeForces Round 223 Div 2 C Sereja and Prefixes
- Codeforces Round #223 (Div. 2)-C. Sereja and Prefixes
- Codeforces 426C Sereja and Swaps【思维】
- Codeforces Round #243 (Div. 2)——Sereja and Table
- Codeforces Round #223 (Div. 1) C. Sereja and Brackets
- Codeforces Round #223 (Div. 1) C. Sereja and Brackets
- Codeforces Round #252 (Div. 2)441D. Valera and Swaps
- Codeforces Round #246 (Div. 2)C. Prime Swaps
- Codeforces Round #246 (Div. 2) C. Prime Swaps
- Codeforces Round #246 (Div. 2) 432C Prime Swaps(脑洞)
- Codeforces Round #246 (Div. 2)-C. Prime Swaps
- JUDE
- 02 - Android入门程序 电话与短信
- eclipse4.3及myeclipse10添加反编译插件
- 单链表的基本操作
- XCode工程内多Targets教程
- Codeforces Round #243 (Div. 2) C. Sereja and Swaps
- 链式队列基本操作之code_legend
- XTU OJ 1210 Happy Number (暴力+打表)
- No embedded stylesheet instruction for file
- python3实现域名查询和whois查询
- memset()
- [Android 4.4.3] 泛泰A860 Omni4.4.3 20140610 RC2.0 三版通刷 by syhost
- jQuery设计思想
- 《深入浅出 Java Concurrency》—锁机制(一)Lock与ReentrantLock