TaoSama's Microcosm

本博客不再更新,新博客地址: http://taosama.github.io

Codeforces #332 A. Laurenty and Shop (枚举)

题意:

sa,b;  l(s,a)=d1,l(s,a)=d2,l(a,b)=d3,ss

分析:

4,

代码:

//
//  Created by TaoSama on 2015-11-21
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

int d1, d2, d3;

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    while(cin >> d1 >> d2 >> d3) {
        int ans = min(d1 + d2 + d3, (d1 + d2) * 2);
        ans = min(ans, 2 * (d1 + d3));
        ans = min(ans, 2 * (d2 + d3));
        cout << ans << '\n';
    }
    return 0;
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/lwt36/article/details/49961263
文章标签: codeforces
上一篇LightOJ 1051 - Good or Bad (dp)
下一篇Codeforces #332 B. Spongebob and Joke (思路)
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭