2017 acm icpc 沈阳（网络赛）5/12 解题报告

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define M 100010
using namespace std;

struct node{
    int l,r;
    long long c;
};

long long col[M*3],data[M];

struct node arr[M*3];  
int sa[M],rank1[M],height[M];
int wa[M],wb[M],wv[M],ws[M];
int num[M],s[M];
int cmp(int *r,int a,int b,int l)
{
    return r[a]==r[b]&&r[a+l]==r[b+l];
}
void get_sa(int *r,int n,int m)//求get函数
{    
    int i,j,p,*x=wa,*y=wb,*t;
    for(i=0;i<m;i++)ws[i]=0;
    for(i=0;i<n;i++)ws[x[i]=r[i]]++;
    for(i=1;i<m;i++)ws[i]+=ws[i-1];
    for(i=n-1;i>=0;i--){if(ws[x[i]]-1<0) continue; sa[--ws[x[i]]]=i;}
    for(j=1,p=1;p<n;j*=2,m=p)
    {
        for(p=0,i=n-j;i<n;i++)y[p++]=i;
        for(i=0;i<n;i++)if(sa[i]>=j)y[p++]=sa[i]-j;
        for(i=0;i<n;i++)wv[i]=x[y[i]];
        for(i=0;i<m;i++)ws[i]=0;
        for(i=0;i<n;i++)ws[wv[i]]++;
        for(i=1;i<m;i++)ws[i]+=ws[i-1];
        for(i=n-1;i>=0;i--){if(ws[wv[i]]-1<0) continue;sa[--ws[wv[i]]]=y[i];}
        for(t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1;i<n;i++)
            x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++;
    }
}
void get_height(int *r,int n)//求height函数
{
    int i,j,k=0;
    for(i=1;i<=n;i++)rank1[sa[i]]=i;//求rank函数
    for(i=0;i<n;height[rank1[i++]]=k)
        for(k?k--:0,j=sa[rank1[i]-1];r[i+k]==r[j+k];k++);
}
int Construct(int l,int r,int k) //建立线段树 
{
　　int mid;

    if(l==r)
    {
        arr[k].l=arr[k].r=r;
        return arr[k].c=height[r];
    }
    mid=(l+r)/2;
    arr[k].l=l;
    arr[k].r=r;

    return arr[k].c=min(Construct(l,mid,2*k),Construct(mid+1,r,2*k+1));
}
int Query(int l,int r,int k) //查询 
{

    int mid;
   
    if(arr[k].l==l&&arr[k].r==r)
   　　   return arr[k].c;
    
　　 mid=(arr[k].l+arr[k].r)/2;

    if(r<=mid)
         return Query(l,r,2*k);
    else if(l>mid)
         return Query(l,r,2*k+1);
  　else
    　　 return min(Query(l,mid,2*k),Query(mid+1,r,2*k+1));
}

char s2[100010];
int main()
{    int T;
    scanf("%d",&T);
    while(T--)
    {    int k,m=130,n;
        scanf("%d",&k);
        scanf("%s",s2);
        int i;
        for(i=0;s2[i];i++)
            num[i]=s2[i];
        num[i]=0;
        n=i;
        get_sa(num,n+1,m); 
        get_height(num,n);
        height[0]=0;
        height[n+1]=0;
        Construct(1,n,1);
        int sum=0,x,y;
    
        if(k==1){
             for(int i=1;i<=n;i++)
            {    if(n-sa[i]-max(height[i],height[i+1])>0)
                sum+=n-sa[i]-max(height[i],height[i+1]);
            }
            printf("%d\n",sum);
            continue;
       　　　　 }  
  
        k--;
        for(int i=2;i+k-1<=n;i++)
        {    x=Query(i,i+k-1,1);
        
            if(height[i-1]>=x||height[i+k]>=x) continue;
            y=max(height[i-1],height[i+k]);
            sum+=x-y;
        } 
        printf("%d\n",sum);
    }
    return 0;
}

#include<stdio.h>
#include<iostream>
#include<algorithm>
#define inf 1<<30

#define MAXN 100005

using namespace std;
int ans[MAXN], a[MAXN],b[MAXN], dp[MAXN], n;  
int len;


int main()
{    

    int T,len1,len2;
    scanf("%d",&T);
    while(T--)
    {    int k;
        scanf("%d%d",&n,&k);
        for (int i = 1; i <= n; ++i)
            scanf("%d",&a[i]);
        
        ans[1] = a[1];
        len = 1;
        
        for (int i = 2; i <= n; ++i) {
            if (a[i] >= ans[len]) {
                ans[++len] = a[i];
            } else {
                int pos = upper_bound(ans, ans + len, a[i]) - ans;
                ans[pos] = a[i];
            }
        }
        len1=len;
        
        for (int i = n; i >=1; --i)
            b[n-i+1]=a[i];
        
                
        ans[1] = b[1];
        len = 1;
        
        for (int i = 2; i <= n; ++i) {
            if (b[i] >= ans[len]) {
                ans[++len] = b[i];
            } else {
                int pos = upper_bound(ans, ans + len, b[i]) - ans;
                ans[pos] = b[i];
            }
        }
        len2=len;
        if(n-k<=len1||n-k<=len2) printf("A is a magic array.\n");
        else printf("A is not a magic array.\n");
    
    }
    return 0;
}

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#define MAX_N 1000005
#define MAX_M 1000005 
using namespace std;

struct edg{
    int v,next,w;
}e[MAX_M];
bool inq[MAX_N];
int d[MAX_N],p[MAX_N],eid=0;
void add_edg(int u,int v,int w)
{    e[eid].v=v;
    e[eid].w=w;
    e[eid].next=p[u];
    p[u]=eid++;
    
}  
void spfa(int s) {
    memset(inq, 0, sizeof(inq));
    memset(d, 0x3f, sizeof(d));
    d[s] = 0;
    inq[s] = true;
    queue<int> q;
    q.push(s);
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        inq[u] = false;
        for (int i = p[u]; i != -1; i = e[i].next) {
            int v = e[i].v;
            if (d[u] + e[i].w < d[v]) {
                d[v] = d[u] + e[i].w;
                if (!inq[v]) {
                    q.push(v);
                    inq[v] = true;
                }
            }
        }
    }
}

int main()
{    int T;
    scanf("%d",&T);
    while(T--)
    {    eid=0;
        memset(p,-1,sizeof(p));
        int n,x,y,w;
        scanf("%d",&n);

       for(int i=0;i<n;i++)
        {    scanf("%d",&x);
            add_edg(0,i+1,x);
            add_edg(i+1,n+1,-x);
         }

        for(int i=0;i<n-1;i++)
        {    scanf("%d%d%d",&x,&y,&w);
            add_edg(x,y,w);
            add_edg(y,x,w);
            
        }
        spfa(0);
        printf("%d\n",-d[n+1]);
    }
    return 0;
}