CodeForcesGym 100517I IQ Test

IQ Test

Time Limit: 2000ms

Memory Limit: 262144KB

This problem will be judged on CodeForcesGym. Original ID: 100517I
64-bit integer IO format: %I64d      Java class name: (Any)

 

解题：动态规划

 #include <bits/stdc++.h>
 using namespace std;
 typedef long long LL;
 const int maxn = ;
 int p[maxn],n;
 struct A {
     int val,id;
     bool operator<(const A &rhs) const {
         return val < rhs.val;
     }
 } a[maxn];
 LL dp[maxn];
 vector<int>ans[maxn];
 int main() {
 #define NAME "iq"
     freopen(NAME".in","r",stdin);
     freopen(NAME".out","w",stdout);
     while(scanf("%d",&n),n) {
         for(int i = ; i <= n; ++i) {
             scanf("%d",&a[i].val);
             a[i].id = i;
         }
         sort(a + ,a + n + );
         memset(dp,0x3f,sizeof dp);
         dp[] = ;
         p[] = -;
         for(int i = ; i < maxn; ++i) ans[i].clear();
         for(int i = ; i <= n; ++i) {
             for(int j = ; j < i; ++j) {
                 LL tmp = dp[j] + (LL)a[i].val*(n - j);
                 if(tmp < dp[i]) {
                     dp[i] = tmp;
                     p[i] = j;
                 }
             }
         }
         printf("%I64d\n",dp[n]);
         int group = ;
         for(int i = p[n]; ~i; i = p[i]) ++ group;
         printf("%d\n",group);
         int cur = n,cnt = group;
         while(~p[cur]) {
             for(int i = cur; i > p[cur]; --i) ans[cnt].push_back(a[i].id);
             cur = p[cur];
             --cnt;
         }
         for(int i = ; i <= group; ++i) {
             printf("%d",ans[i].size());
             for(auto &it:ans[i]) printf(" %d",it);
             putchar('\n');
         }
     }
     return ;
 }