ural 1025 Democracy in Danger
2011-02-04 13:36
309 查看
简单的贪心.
]#include<iostream> using namespace std; int A[105]; void swap(int i,int j) { int temp; temp=A[i]; A[i]=A[j]; A[j]=temp; return; } int main() { int i,j,k; int n,tot=0; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&A[i]); for(j=i;j>1;j--) if(A[j]<A[j-1]) swap(j,j-1); } n=(n>>1)+1; for(i=1;i<=n;i++) tot+=(A[i]>>1)+1; printf("%d/n",tot); return 0; }
相关文章推荐
- (贪心5.2.7)URAL 1025 Democracy in Danger
- URAL 1025 — Democracy in Danger
- URAL 1025 Democracy in Danger
- Ural 1025 Democracy in Danger 解题报告
- Ural 1025 Democracy in Danger 解题报告
- Ural 1025-Democrary in Danger
- POJ 2370 Democracy in Danger
- poj 2370 Democracy in danger
- POJ 2370 Democracy in danger
- poj2370 Democracy in danger!
- Overcome ACM POJ 2370 - Democracy in danger
- 11 URAL1025 Democracy in Danger
- POJ 2370 Democracy in danger(简单贪心)
- POJ 2370 Democracy in danger G++
- Overcome ACM POJ 2370 - Democracy in danger
- poj 2370 Democracy in danger
- uva 1025 democrazy in danger
- URAL - 2020 Traffic Jam in Flower Town(模拟)
- 城市里的间谍(A Spy in the Metro UVa 1025)最详细题解
- HDU 1025 —— Constructing Roads In JGShining's Kingdom 最长上升子序列