HDU 4283 You Are the One 제3 7 회 ACM / ICPC 톈 진사 이 버 전 1006 문제 (DP)
6946 단어 ICPC
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 402 Accepted Submission(s): 221
Problem Description
The TV shows such as You Are the One has been very popular. In order to meet the need of boys who are still single, TJUT hold the show itself. The show is hold in the Small hall, so it attract a lot of boys and girls. Now there are n boys enrolling in. At the beginning, the n boys stand in a row and go to the stage one by one. However, the director suddenly knows that very boy has a value of diaosi D, if the boy is k-th one go to the stage, the unhappiness of him will be (k-1)*D, because he has to wait for (k-1) people. Luckily, there is a dark room in the Small hall, so the director can put the boy into the dark room temporarily and let the boys behind his go to stage before him. For the dark room is very narrow, the boy who first get into dark room has to leave last. The director wants to change the order of boys by the dark room, so the summary of unhappiness will be least. Can you help him?
Input
The first line contains a single integer T, the number of test cases. For each case, the first line is n (0 < n <= 100)
The next n line are n integer D1-Dn means the value of diaosi of boys (0 <= Di <= 100)
Output
For each test case, output the least summary of unhappiness .
Sample Input
2 5 1 2 3 4 5 5 5 4 3 2 2
Sample Output
Case #1: 20 Case #2: 24
Source
2012 ACM/ICPC Asia Regional Tianjin Online
Recommend
liuyiding
이렇게 간단 한 DP 를 경기 할 때 생각 하지 못 했 어...
에이...DP 연습 을 많이 해 야 죠.
/*
HDU 4283
DP
*/
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
const int MAXN=120;
const int INF=0x3f3f3f3f;
int num[MAXN];
int sum[MAXN];
int dp[MAXN][MAXN];//dp[i][j] i j
int main()
{
int T;
int n;
int iCase=0;
scanf("%d",&T);
while(T--)
{
iCase++;
scanf("%d",&n);
sum[0]=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&num[i]);
sum[i]=sum[i-1]+num[i];
}
for(int i=1;i<=n;i++)
for(int j=i;j<=n;j++)
dp[i][j]=INF;
for(int i=1;i<=n;i++)
dp[i][i]=0;
for(int len=1;len<n;len++)
for(int i=1;i+len<=n;i++)
{
int j=i+len;
dp[i][j]=min(dp[i][j],dp[i+1][j]+sum[j]-sum[i]);
for(int k=i+1;k<=j;k++)
dp[i][j]=min(dp[i][j],dp[i+1][k]+num[i]*(k-i)+dp[k+1][j]+(sum[j]-sum[k])*(k-i+1));
}
printf("Case #%d: %d
",iCase,dp[1][n]);
}
return 0;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
2013 ACMICPC 항주 라이브 I 문제사고방식: 기억화 검색. dp[S]는 남은 상태가 S일 때 기수가 마법석을 최대 얼마나 얻을 수 있는지 나타낸다....
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.