codeforces 461A Appleman and Toastman
来源:互联网 发布:php 日期格式 编辑:程序博客网 时间:2024/05/16 08:20
题意:
略
思路:
贪心。既然希望尽量达到最大,排好序,每次都把最小的那个去掉,这样比它大的数就可以多加几次。
AC代码:
#include <cstring>#include <cstdlib>#include <algorithm>#include <iostream>#include <cstdio>typedef long long ll;using namespace std;const int MAXN = 3*100005;long long sum[MAXN], a[MAXN];int main(){ int n; scanf("%d", &n); for(int i = 1;i <= n; i++) scanf("%I64d", &a[i]); //special if(n == 1) {cout<<a[1]<<endl; return 0;} if(n == 2) {cout<<(a[1]+a[2])*2<<endl; return 0;} //normal sort(a+1, a+n+1); for(int i = 1;i <= n; i++) sum[i] = sum[i-1] + a[i]; long long res = 0; res += sum[n]; for(int i = n, j = 1;j <= n; j++) { if(i - j == 1) { res += sum[i] - sum[j-1]; break; } res += a[j]; res += sum[i] - sum[j]; } cout<<res<<endl; return 0;}
0 0
- Codeforces-461A Appleman and Toastman
- Appleman and Toastman - CodeForces 461 A 水题
- Codeforces 461A Appleman and Toastman
- Codeforces 461A Appleman and Toastman(贪心)
- codeforces 461A Appleman and Toastman
- 【codeforces】 461A Appleman and Toastman
- CodeForces 461A Appleman and Toastman(贪心)
- CodeForces 461A Appleman and Toastman
- CodeForces 461A Appleman and Toastman
- codeforces 461A Appleman and Toastman
- 461A - Appleman and Toastman
- A. Appleman and Toastman(codeforces#263div1)
- A. Appleman and Toastman
- CF 461 A Appleman and Toastman
- 【CODEFORCES】 C. Appleman and Toastman
- Codeforces Round #263 (Div. 1) A. Appleman and Toastman
- CodeForces-462C Appleman and Toastman
- CodeForces 462C Appleman and Toastman 贪心
- UVa10129 Play on Words
- FTP文件传输协议
- 你值得拥有的数值计算软件 —— Octave
- Spark参数调优&&Tricks
- Android中保存图片的两种方式
- codeforces 461A Appleman and Toastman
- cocos2d-x -- 渠道SDK【棱镜】接入(2)
- ubuntu 下安装 mysql
- format——MATLAB
- pat 1002. A+B for Polynomials (25)
- hdu-3555-Bomb
- 矩阵转置
- ExpandableListView.setOnChildClickListener获取不到点击事件 (
- bzoj 1709: [Usaco2007 Oct]Super Paintball超级弹珠