Codeforces 437C The Child and Toy(贪心)
2014-06-02 12:52
281 查看
题目连接:Codeforces 437C The Child and Toy
贪心,每条绳子都是需要割断的,那就先割断最大值对应的那部分周围的绳子。
贪心,每条绳子都是需要割断的,那就先割断最大值对应的那部分周围的绳子。
#include <iostream> #include <cstring> #include <cstdio> #include <algorithm> using namespace std; const int MAX_N = 1000 + 10; int G[MAX_N][MAX_N]; struct Value { int val; int i; }; int cmp(Value a, Value b) { return a.val > b.val; } Value value[MAX_N]; int value1[MAX_N]; int main() { memset(G, 0, sizeof(G)); int n, m; scanf("%d%d", &n, &m); for(int i = 1;i <= n; i++) { scanf("%d", &value[i].val); value1[i] = value[i].val; value[i].i = i; } int u, v; for(int i = 0; i < m; i++) { scanf("%d%d", &u, &v); G[u][v] = G[v][u] = 1; } sort(value + 1, value + n + 1, cmp); int sum = 0; int b; for(int i = 1; i <= n; i++) { b = value[i].i; for(int j = 1; j <= n; j++) { if(G[b][j]) { sum += value1[j]; G[b][j] = G[j][b] = 0; } } } printf("%d\n", sum); return 0; }
相关文章推荐
- 贪心-Codeforces 777B
- codeforces 460 C Present 二分+贪心 最大化最小值问题
- Codeforces 460C Present (贪心 + 二分)
- Codeforces 579D "Or" Game【贪心+暴力按位处理】
- codeforces 792E —— Colored Balls (贪心,不定方程,数学)
- Codeforces 389A Fox and Number Game(贪心)
- Codeforces 492C Vanya and Exams【贪心】
- Codeforces-Counting Kangaroos is Fun【贪心】【二分】
- CodeForces 416C Booking System(贪心)
- codeforces 469D. Two Sets(贪心or并查集)
- codeforces 324# C. Marina and Vasya (贪心)
- Codeforces 797C Minimal string【贪心】
- codeforces 332C Students' Revenge 贪心
- Codeforces 798C Mike and gcd problem gcd+贪心
- Codeforces 735B - Urbanization 贪心
- CodeForces 363D 【二分+贪心】
- CodeForces 261A Maxim and Discounts [想法/贪心题]
- codeforces 798 D. Mike and distribution 二维贪心
- CodeForces 712C Memory and De-Evolution(贪心+数学)
- Codeforces 226B Naughty Stone Piles 贪心