알고리즘 문제 풀이/1DP_과제(~180615)
171230_2217_로프
//https://www.acmicpc.net/problem/2217#include #include using namespace std; int main() { int n,tmp; int rope[100001]; int ans=0; cin >> n; for(int i=1; i> rope[i]; sort(rope+1, rope+n+1); for(int i=1; i
